%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN351+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:22 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 111 ( 33 ~; 32 |; 32 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn 14 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
? [X3,X4] :
! [X5] :
( big_f(X1,X4,X1,X5)
=> ( ( big_f(X1,X3,X1,X4)
<=> big_f(X3,X2,X3,X4) )
=> ( big_f(X1,X3,X1,X4)
=> ( ( big_f(X1,X4,X3,X4)
=> big_f(X1,X5,X3,X5) )
& ( big_f(X1,X5,X3,X5)
=> ( big_f(X1,X3,X1,X4)
<=> big_f(X1,X4,X3,X4) ) ) ) ) ) ),
file('/tmp/tmpEpehIs/sel_SYN351+1.p_1',church_46_18_3) ).
fof(2,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
! [X5] :
( big_f(X1,X4,X1,X5)
=> ( ( big_f(X1,X3,X1,X4)
<=> big_f(X3,X2,X3,X4) )
=> ( big_f(X1,X3,X1,X4)
=> ( ( big_f(X1,X4,X3,X4)
=> big_f(X1,X5,X3,X5) )
& ( big_f(X1,X5,X3,X5)
=> ( big_f(X1,X3,X1,X4)
<=> big_f(X1,X4,X3,X4) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1,X2] :
! [X3,X4] :
? [X5] :
( big_f(X1,X4,X1,X5)
& ( ~ big_f(X1,X3,X1,X4)
| big_f(X3,X2,X3,X4) )
& ( ~ big_f(X3,X2,X3,X4)
| big_f(X1,X3,X1,X4) )
& big_f(X1,X3,X1,X4)
& ( ( big_f(X1,X4,X3,X4)
& ~ big_f(X1,X5,X3,X5) )
| ( big_f(X1,X5,X3,X5)
& ( ~ big_f(X1,X3,X1,X4)
| ~ big_f(X1,X4,X3,X4) )
& ( big_f(X1,X3,X1,X4)
| big_f(X1,X4,X3,X4) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X6,X7] :
! [X8,X9] :
? [X10] :
( big_f(X6,X9,X6,X10)
& ( ~ big_f(X6,X8,X6,X9)
| big_f(X8,X7,X8,X9) )
& ( ~ big_f(X8,X7,X8,X9)
| big_f(X6,X8,X6,X9) )
& big_f(X6,X8,X6,X9)
& ( ( big_f(X6,X9,X8,X9)
& ~ big_f(X6,X10,X8,X10) )
| ( big_f(X6,X10,X8,X10)
& ( ~ big_f(X6,X8,X6,X9)
| ~ big_f(X6,X9,X8,X9) )
& ( big_f(X6,X8,X6,X9)
| big_f(X6,X9,X8,X9) ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X8,X9] :
( big_f(esk1_0,X9,esk1_0,esk3_2(X8,X9))
& ( ~ big_f(esk1_0,X8,esk1_0,X9)
| big_f(X8,esk2_0,X8,X9) )
& ( ~ big_f(X8,esk2_0,X8,X9)
| big_f(esk1_0,X8,esk1_0,X9) )
& big_f(esk1_0,X8,esk1_0,X9)
& ( ( big_f(esk1_0,X9,X8,X9)
& ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
| ( big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
& ( ~ big_f(esk1_0,X8,esk1_0,X9)
| ~ big_f(esk1_0,X9,X8,X9) )
& ( big_f(esk1_0,X8,esk1_0,X9)
| big_f(esk1_0,X9,X8,X9) ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X8,X9] :
( big_f(esk1_0,X9,esk1_0,esk3_2(X8,X9))
& ( ~ big_f(esk1_0,X8,esk1_0,X9)
| big_f(X8,esk2_0,X8,X9) )
& ( ~ big_f(X8,esk2_0,X8,X9)
| big_f(esk1_0,X8,esk1_0,X9) )
& big_f(esk1_0,X8,esk1_0,X9)
& ( big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
| big_f(esk1_0,X9,X8,X9) )
& ( ~ big_f(esk1_0,X8,esk1_0,X9)
| ~ big_f(esk1_0,X9,X8,X9)
| big_f(esk1_0,X9,X8,X9) )
& ( big_f(esk1_0,X8,esk1_0,X9)
| big_f(esk1_0,X9,X8,X9)
| big_f(esk1_0,X9,X8,X9) )
& ( big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
| ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
& ( ~ big_f(esk1_0,X8,esk1_0,X9)
| ~ big_f(esk1_0,X9,X8,X9)
| ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
& ( big_f(esk1_0,X8,esk1_0,X9)
| big_f(esk1_0,X9,X8,X9)
| ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(8,negated_conjecture,
( ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
| ~ big_f(esk1_0,X2,X1,X2)
| ~ big_f(esk1_0,X1,esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(13,negated_conjecture,
big_f(esk1_0,X1,esk1_0,X2),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(25,negated_conjecture,
( ~ big_f(esk1_0,X2,X1,X2)
| $false
| ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2)) ),
inference(rw,[status(thm)],[8,13,theory(equality)]) ).
cnf(26,negated_conjecture,
( ~ big_f(esk1_0,X2,X1,X2)
| ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2)) ),
inference(cn,[status(thm)],[25,theory(equality)]) ).
cnf(27,negated_conjecture,
~ big_f(esk1_0,X1,esk1_0,X1),
inference(spm,[status(thm)],[26,13,theory(equality)]) ).
cnf(29,negated_conjecture,
$false,
inference(rw,[status(thm)],[27,13,theory(equality)]) ).
cnf(30,negated_conjecture,
$false,
inference(cn,[status(thm)],[29,theory(equality)]) ).
cnf(31,negated_conjecture,
$false,
30,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN351+1.p
% --creating new selector for []
% -running prover on /tmp/tmpEpehIs/sel_SYN351+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN351+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN351+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN351+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
%
%------------------------------------------------------------------------------