TSTP Solution File: SYN345+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN345+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:15:56 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 131 ( 0 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 153 ( 51 ~; 56 |; 26 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 15 sgn 14 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X1,X2,X3)
=> big_f(X4,X3,X5) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,X3,X4)
=> big_f(X3,X5,X5) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(X3,X4,X5)
=> ( big_f(X2,X2,X3)
& ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) ) ) ) ) ),
file('/tmp/tmpMt1x2N/sel_SYN345+1.p_1',church_46_16_4) ).
fof(2,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X1,X2,X3)
=> big_f(X4,X3,X5) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,X3,X4)
=> big_f(X3,X5,X5) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(X3,X4,X5)
=> ( big_f(X2,X2,X3)
& ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1,X2] :
! [X3,X4] :
? [X5] :
( ( ( big_f(X1,X2,X3)
& ~ big_f(X4,X3,X5) )
| ~ big_f(X1,X1,X2)
| big_f(X1,X2,X2) )
& ( ( big_f(X2,X3,X4)
& ~ big_f(X3,X5,X5) )
| ~ big_f(X1,X2,X2)
| big_f(X1,X1,X2) )
& big_f(X3,X4,X5)
& ( ~ big_f(X2,X2,X3)
| ( ( ~ big_f(X1,X1,X2)
| ~ big_f(X1,X2,X2) )
& ( big_f(X1,X1,X2)
| big_f(X1,X2,X2) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X6,X7] :
! [X8,X9] :
? [X10] :
( ( ( big_f(X6,X7,X8)
& ~ big_f(X9,X8,X10) )
| ~ big_f(X6,X6,X7)
| big_f(X6,X7,X7) )
& ( ( big_f(X7,X8,X9)
& ~ big_f(X8,X10,X10) )
| ~ big_f(X6,X7,X7)
| big_f(X6,X6,X7) )
& big_f(X8,X9,X10)
& ( ~ big_f(X7,X7,X8)
| ( ( ~ big_f(X6,X6,X7)
| ~ big_f(X6,X7,X7) )
& ( big_f(X6,X6,X7)
| big_f(X6,X7,X7) ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X8,X9] :
( ( ( big_f(esk1_0,esk2_0,X8)
& ~ big_f(X9,X8,esk3_2(X8,X9)) )
| ~ big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0) )
& ( ( big_f(esk2_0,X8,X9)
& ~ big_f(X8,esk3_2(X8,X9),esk3_2(X8,X9)) )
| ~ big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) )
& big_f(X8,X9,esk3_2(X8,X9))
& ( ~ big_f(esk2_0,esk2_0,X8)
| ( ( ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0) )
& ( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0) ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X8,X9] :
( ( big_f(esk1_0,esk2_0,X8)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0) )
& ( ~ big_f(X9,X8,esk3_2(X8,X9))
| ~ big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0) )
& ( big_f(esk2_0,X8,X9)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) )
& ( ~ big_f(X8,esk3_2(X8,X9),esk3_2(X8,X9))
| ~ big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) )
& big_f(X8,X9,esk3_2(X8,X9))
& ( ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X8) )
& ( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X8) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
big_f(X1,X2,esk3_2(X1,X2)),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk2_0,X1,X2)
| ~ big_f(esk1_0,esk2_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(X1,X2,esk3_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(14,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| big_f(esk1_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[7,9,theory(equality)]) ).
cnf(15,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[12,9,theory(equality)]) ).
cnf(18,negated_conjecture,
big_f(esk1_0,esk2_0,esk2_0),
inference(csr,[status(thm)],[15,14]) ).
cnf(20,negated_conjecture,
( ~ big_f(esk1_0,esk1_0,esk2_0)
| $false
| ~ big_f(esk2_0,esk2_0,X1) ),
inference(rw,[status(thm)],[8,18,theory(equality)]) ).
cnf(21,negated_conjecture,
( ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X1) ),
inference(cn,[status(thm)],[20,theory(equality)]) ).
cnf(22,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2))
| $false ),
inference(rw,[status(thm)],[10,18,theory(equality)]) ).
cnf(23,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(cn,[status(thm)],[22,theory(equality)]) ).
cnf(25,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk2_0,X1,X2)
| $false ),
inference(rw,[status(thm)],[11,18,theory(equality)]) ).
cnf(26,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk2_0,X1,X2) ),
inference(cn,[status(thm)],[25,theory(equality)]) ).
cnf(28,negated_conjecture,
( big_f(esk2_0,X2,X3)
| ~ big_f(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[21,26,theory(equality)]) ).
cnf(29,negated_conjecture,
big_f(esk2_0,X1,X2),
inference(spm,[status(thm)],[28,9,theory(equality)]) ).
cnf(35,negated_conjecture,
( ~ big_f(esk1_0,esk1_0,esk2_0)
| $false ),
inference(rw,[status(thm)],[21,29,theory(equality)]) ).
cnf(36,negated_conjecture,
~ big_f(esk1_0,esk1_0,esk2_0),
inference(cn,[status(thm)],[35,theory(equality)]) ).
cnf(37,negated_conjecture,
big_f(esk1_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[23,29,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
inference(rw,[status(thm)],[36,37,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(41,negated_conjecture,
$false,
40,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN345+1.p
% --creating new selector for []
% -running prover on /tmp/tmpMt1x2N/sel_SYN345+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN345+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN345+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN345+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
%
%------------------------------------------------------------------------------