TSTP Solution File: SYN349+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN349+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 13:16:13 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 171 ( 0 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 218 ( 74 ~; 98 |; 36 &)
% ( 8 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 44 ( 0 sgn 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
file('/tmp/tmpNRbb0T/sel_SYN349+1.p_1',church_46_17_5) ).
fof(2,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1] :
? [X2] :
! [X3] :
? [X4] :
( ( ~ big_f(X1,X4)
| big_f(X2,X4) )
& ( ~ big_f(X2,X4)
| big_f(X1,X4) )
& ( ( ( ( ( ~ big_f(X1,X4)
| ~ big_f(X4,X3) )
& ( big_f(X1,X4)
| big_f(X4,X3) ) )
| ~ big_f(X3,X4) )
& ( ( ( ~ big_f(X1,X4)
| big_f(X4,X3) )
& ( ~ big_f(X4,X3)
| big_f(X1,X4) ) )
| big_f(X3,X4) ) )
| ~ big_f(X4,X2) )
& ( ( ( ( ( ~ big_f(X1,X4)
| ~ big_f(X4,X3) )
& ( big_f(X1,X4)
| big_f(X4,X3) ) )
| big_f(X3,X4) )
& ( ~ big_f(X3,X4)
| ( ( ~ big_f(X1,X4)
| big_f(X4,X3) )
& ( ~ big_f(X4,X3)
| big_f(X1,X4) ) ) ) )
| big_f(X4,X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X5] :
? [X6] :
! [X7] :
? [X8] :
( ( ~ big_f(X5,X8)
| big_f(X6,X8) )
& ( ~ big_f(X6,X8)
| big_f(X5,X8) )
& ( ( ( ( ( ~ big_f(X5,X8)
| ~ big_f(X8,X7) )
& ( big_f(X5,X8)
| big_f(X8,X7) ) )
| ~ big_f(X7,X8) )
& ( ( ( ~ big_f(X5,X8)
| big_f(X8,X7) )
& ( ~ big_f(X8,X7)
| big_f(X5,X8) ) )
| big_f(X7,X8) ) )
| ~ big_f(X8,X6) )
& ( ( ( ( ( ~ big_f(X5,X8)
| ~ big_f(X8,X7) )
& ( big_f(X5,X8)
| big_f(X8,X7) ) )
| big_f(X7,X8) )
& ( ~ big_f(X7,X8)
| ( ( ~ big_f(X5,X8)
| big_f(X8,X7) )
& ( ~ big_f(X8,X7)
| big_f(X5,X8) ) ) ) )
| big_f(X8,X6) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X5,X7] :
( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk1_1(X5),esk2_2(X5,X7)) )
& ( ~ big_f(esk1_1(X5),esk2_2(X5,X7))
| big_f(X5,esk2_2(X5,X7)) )
& ( ( ( ( ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7) ) )
| ~ big_f(X7,esk2_2(X5,X7)) )
& ( ( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7)) ) )
| big_f(X7,esk2_2(X5,X7)) ) )
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ( ( ( ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7) ) )
| big_f(X7,esk2_2(X5,X7)) )
& ( ~ big_f(X7,esk2_2(X5,X7))
| ( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7)) ) ) ) )
| big_f(esk2_2(X5,X7),esk1_1(X5)) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X5,X7] :
( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk1_1(X5),esk2_2(X5,X7)) )
& ( ~ big_f(esk1_1(X5),esk2_2(X5,X7))
| big_f(X5,esk2_2(X5,X7)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(8,negated_conjecture,
( big_f(esk2_2(X1,X2),esk1_1(X1))
| big_f(esk2_2(X1,X2),X2)
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( big_f(esk2_2(X1,X2),esk1_1(X1))
| big_f(X2,esk2_2(X1,X2))
| big_f(esk2_2(X1,X2),X2)
| big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( big_f(X2,esk2_2(X1,X2))
| big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(14,negated_conjecture,
( ~ big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),X2)
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(15,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(16,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(17,negated_conjecture,
( big_f(esk2_2(X3,esk1_1(X3)),esk1_1(X3))
| big_f(X3,esk2_2(X3,esk1_1(X3)))
| big_f(esk1_1(X3),esk2_2(X3,esk1_1(X3))) ),
inference(ef,[status(thm)],[9,theory(equality)]) ).
cnf(20,negated_conjecture,
( big_f(esk2_2(X3,esk1_1(X3)),esk1_1(X3))
| big_f(X3,esk2_2(X3,esk1_1(X3))) ),
inference(csr,[status(thm)],[17,15]) ).
cnf(21,negated_conjecture,
( big_f(X1,esk2_2(X1,esk1_1(X1)))
| big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))
| ~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)) ),
inference(spm,[status(thm)],[11,20,theory(equality)]) ).
cnf(23,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))
| big_f(X1,esk2_2(X1,esk1_1(X1))) ),
inference(csr,[status(thm)],[21,20]) ).
cnf(24,negated_conjecture,
big_f(X1,esk2_2(X1,esk1_1(X1))),
inference(csr,[status(thm)],[23,15]) ).
cnf(25,negated_conjecture,
big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1))),
inference(spm,[status(thm)],[16,24,theory(equality)]) ).
cnf(31,negated_conjecture,
( big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| ~ big_f(X1,esk2_2(X1,esk1_1(X1))) ),
inference(spm,[status(thm)],[8,25,theory(equality)]) ).
cnf(33,negated_conjecture,
( ~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| ~ big_f(X1,esk2_2(X1,esk1_1(X1))) ),
inference(spm,[status(thm)],[14,25,theory(equality)]) ).
cnf(36,negated_conjecture,
( big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| $false ),
inference(rw,[status(thm)],[31,24,theory(equality)]) ).
cnf(37,negated_conjecture,
big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)),
inference(cn,[status(thm)],[36,theory(equality)]) ).
cnf(39,negated_conjecture,
( ~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| $false ),
inference(rw,[status(thm)],[33,24,theory(equality)]) ).
cnf(40,negated_conjecture,
~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)),
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(46,negated_conjecture,
$false,
inference(rw,[status(thm)],[40,37,theory(equality)]) ).
cnf(47,negated_conjecture,
$false,
inference(cn,[status(thm)],[46,theory(equality)]) ).
cnf(48,negated_conjecture,
$false,
47,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN349+1.p
% --creating new selector for []
% -running prover on /tmp/tmpNRbb0T/sel_SYN349+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN349+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN349+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN349+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------