TSTP Solution File: SYN347+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN347+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:16:04 EST 2010
% Result : Theorem 0.15s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 127 ( 43 ~; 58 |; 20 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 14 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X3,X5)
<=> big_f(X4,X5) )
<=> big_f(X1,X2) )
| ( big_f(X1,X5)
<=> big_f(X2,X5) ) ),
file('/tmp/tmpRHQAJV/sel_SYN347+1.p_1',church_46_17_3) ).
fof(2,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
! [X5] :
( ( ( big_f(X3,X5)
<=> big_f(X4,X5) )
<=> big_f(X1,X2) )
| ( big_f(X1,X5)
<=> big_f(X2,X5) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1,X2] :
! [X3,X4] :
? [X5] :
( ( ( ( ~ big_f(X3,X5)
| ~ big_f(X4,X5) )
& ( big_f(X3,X5)
| big_f(X4,X5) ) )
| ~ big_f(X1,X2) )
& ( ( ( ~ big_f(X3,X5)
| big_f(X4,X5) )
& ( ~ big_f(X4,X5)
| big_f(X3,X5) ) )
| big_f(X1,X2) )
& ( ~ big_f(X1,X5)
| ~ big_f(X2,X5) )
& ( big_f(X1,X5)
| big_f(X2,X5) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X6,X7] :
! [X8,X9] :
? [X10] :
( ( ( ( ~ big_f(X8,X10)
| ~ big_f(X9,X10) )
& ( big_f(X8,X10)
| big_f(X9,X10) ) )
| ~ big_f(X6,X7) )
& ( ( ( ~ big_f(X8,X10)
| big_f(X9,X10) )
& ( ~ big_f(X9,X10)
| big_f(X8,X10) ) )
| big_f(X6,X7) )
& ( ~ big_f(X6,X10)
| ~ big_f(X7,X10) )
& ( big_f(X6,X10)
| big_f(X7,X10) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X8,X9] :
( ( ( ( ~ big_f(X8,esk3_2(X8,X9))
| ~ big_f(X9,esk3_2(X8,X9)) )
& ( big_f(X8,esk3_2(X8,X9))
| big_f(X9,esk3_2(X8,X9)) ) )
| ~ big_f(esk1_0,esk2_0) )
& ( ( ( ~ big_f(X8,esk3_2(X8,X9))
| big_f(X9,esk3_2(X8,X9)) )
& ( ~ big_f(X9,esk3_2(X8,X9))
| big_f(X8,esk3_2(X8,X9)) ) )
| big_f(esk1_0,esk2_0) )
& ( ~ big_f(esk1_0,esk3_2(X8,X9))
| ~ big_f(esk2_0,esk3_2(X8,X9)) )
& ( big_f(esk1_0,esk3_2(X8,X9))
| big_f(esk2_0,esk3_2(X8,X9)) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X8,X9] :
( ( ~ big_f(X8,esk3_2(X8,X9))
| ~ big_f(X9,esk3_2(X8,X9))
| ~ big_f(esk1_0,esk2_0) )
& ( big_f(X8,esk3_2(X8,X9))
| big_f(X9,esk3_2(X8,X9))
| ~ big_f(esk1_0,esk2_0) )
& ( ~ big_f(X8,esk3_2(X8,X9))
| big_f(X9,esk3_2(X8,X9))
| big_f(esk1_0,esk2_0) )
& ( ~ big_f(X9,esk3_2(X8,X9))
| big_f(X8,esk3_2(X8,X9))
| big_f(esk1_0,esk2_0) )
& ( ~ big_f(esk1_0,esk3_2(X8,X9))
| ~ big_f(esk2_0,esk3_2(X8,X9)) )
& ( big_f(esk1_0,esk3_2(X8,X9))
| big_f(esk2_0,esk3_2(X8,X9)) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
( big_f(esk2_0,esk3_2(X1,X2))
| big_f(esk1_0,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ big_f(esk2_0,esk3_2(X1,X2))
| ~ big_f(esk1_0,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( big_f(esk1_0,esk2_0)
| big_f(X1,esk3_2(X1,X2))
| ~ big_f(X2,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_f(esk1_0,esk2_0)
| big_f(X1,esk3_2(X2,X1))
| ~ big_f(X2,esk3_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( big_f(X1,esk3_2(X2,X1))
| big_f(X2,esk3_2(X2,X1))
| ~ big_f(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( ~ big_f(esk1_0,esk2_0)
| ~ big_f(X1,esk3_2(X2,X1))
| ~ big_f(X2,esk3_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(14,negated_conjecture,
( big_f(X1,esk3_2(esk1_0,X1))
| big_f(esk1_0,esk2_0)
| big_f(esk2_0,esk3_2(esk1_0,X1)) ),
inference(spm,[status(thm)],[10,7,theory(equality)]) ).
cnf(16,negated_conjecture,
( big_f(esk2_0,esk3_2(esk1_0,X1))
| ~ big_f(X1,esk3_2(esk1_0,X1))
| ~ big_f(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[12,7,theory(equality)]) ).
cnf(17,negated_conjecture,
( big_f(esk2_0,esk3_2(esk1_0,esk2_0))
| big_f(esk1_0,esk2_0) ),
inference(ef,[status(thm)],[14,theory(equality)]) ).
cnf(23,negated_conjecture,
( big_f(esk1_0,esk3_2(esk1_0,esk2_0))
| big_f(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[9,17,theory(equality)]) ).
cnf(30,negated_conjecture,
( big_f(esk2_0,esk3_2(esk1_0,esk1_0))
| ~ big_f(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[16,7,theory(equality)]) ).
cnf(34,negated_conjecture,
( big_f(esk1_0,esk2_0)
| ~ big_f(esk2_0,esk3_2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[8,23,theory(equality)]) ).
cnf(37,negated_conjecture,
big_f(esk1_0,esk2_0),
inference(csr,[status(thm)],[34,17]) ).
cnf(39,negated_conjecture,
( big_f(esk2_0,esk3_2(esk1_0,esk1_0))
| $false ),
inference(rw,[status(thm)],[30,37,theory(equality)]) ).
cnf(40,negated_conjecture,
big_f(esk2_0,esk3_2(esk1_0,esk1_0)),
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(50,negated_conjecture,
( big_f(X1,esk3_2(X2,X1))
| big_f(X2,esk3_2(X2,X1))
| $false ),
inference(rw,[status(thm)],[11,37,theory(equality)]) ).
cnf(51,negated_conjecture,
( big_f(X1,esk3_2(X2,X1))
| big_f(X2,esk3_2(X2,X1)) ),
inference(cn,[status(thm)],[50,theory(equality)]) ).
cnf(52,negated_conjecture,
big_f(X3,esk3_2(X3,X3)),
inference(ef,[status(thm)],[51,theory(equality)]) ).
cnf(56,negated_conjecture,
~ big_f(esk2_0,esk3_2(esk1_0,esk1_0)),
inference(spm,[status(thm)],[8,52,theory(equality)]) ).
cnf(57,negated_conjecture,
$false,
inference(rw,[status(thm)],[56,40,theory(equality)]) ).
cnf(58,negated_conjecture,
$false,
inference(cn,[status(thm)],[57,theory(equality)]) ).
cnf(59,negated_conjecture,
$false,
58,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN347+1.p
% --creating new selector for []
% -running prover on /tmp/tmpRHQAJV/sel_SYN347+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN347+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN347+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN347+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
%
%------------------------------------------------------------------------------