TSTP Solution File: SYN082+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN082+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:13:19 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 81 ( 30 ~; 30 |; 17 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
! [X1] :
( big_f(X1,f(X1))
<=> ? [X2] :
( ! [X3] :
( big_f(X3,X2)
=> big_f(X3,f(X1)) )
& big_f(X1,X2) ) ),
file('/tmp/tmpCV5HC2/sel_SYN082+1.p_1',pel60) ).
fof(2,negated_conjecture,
~ ! [X1] :
( big_f(X1,f(X1))
<=> ? [X2] :
( ! [X3] :
( big_f(X3,X2)
=> big_f(X3,f(X1)) )
& big_f(X1,X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
? [X1] :
( ( ~ big_f(X1,f(X1))
| ! [X2] :
( ? [X3] :
( big_f(X3,X2)
& ~ big_f(X3,f(X1)) )
| ~ big_f(X1,X2) ) )
& ( big_f(X1,f(X1))
| ? [X2] :
( ! [X3] :
( ~ big_f(X3,X2)
| big_f(X3,f(X1)) )
& big_f(X1,X2) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
? [X4] :
( ( ~ big_f(X4,f(X4))
| ! [X5] :
( ? [X6] :
( big_f(X6,X5)
& ~ big_f(X6,f(X4)) )
| ~ big_f(X4,X5) ) )
& ( big_f(X4,f(X4))
| ? [X7] :
( ! [X8] :
( ~ big_f(X8,X7)
| big_f(X8,f(X4)) )
& big_f(X4,X7) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ~ big_f(esk1_0,f(esk1_0))
| ! [X5] :
( ( big_f(esk2_1(X5),X5)
& ~ big_f(esk2_1(X5),f(esk1_0)) )
| ~ big_f(esk1_0,X5) ) )
& ( big_f(esk1_0,f(esk1_0))
| ( ! [X8] :
( ~ big_f(X8,esk3_0)
| big_f(X8,f(esk1_0)) )
& big_f(esk1_0,esk3_0) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X5,X8] :
( ( ( ( ~ big_f(X8,esk3_0)
| big_f(X8,f(esk1_0)) )
& big_f(esk1_0,esk3_0) )
| big_f(esk1_0,f(esk1_0)) )
& ( ( big_f(esk2_1(X5),X5)
& ~ big_f(esk2_1(X5),f(esk1_0)) )
| ~ big_f(esk1_0,X5)
| ~ big_f(esk1_0,f(esk1_0)) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X5,X8] :
( ( ~ big_f(X8,esk3_0)
| big_f(X8,f(esk1_0))
| big_f(esk1_0,f(esk1_0)) )
& ( big_f(esk1_0,esk3_0)
| big_f(esk1_0,f(esk1_0)) )
& ( big_f(esk2_1(X5),X5)
| ~ big_f(esk1_0,X5)
| ~ big_f(esk1_0,f(esk1_0)) )
& ( ~ big_f(esk2_1(X5),f(esk1_0))
| ~ big_f(esk1_0,X5)
| ~ big_f(esk1_0,f(esk1_0)) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ big_f(esk1_0,f(esk1_0))
| ~ big_f(esk1_0,X1)
| ~ big_f(esk2_1(X1),f(esk1_0)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( big_f(esk2_1(X1),X1)
| ~ big_f(esk1_0,f(esk1_0))
| ~ big_f(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( big_f(esk1_0,f(esk1_0))
| big_f(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( big_f(esk1_0,f(esk1_0))
| big_f(X1,f(esk1_0))
| ~ big_f(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
~ big_f(esk1_0,f(esk1_0)),
inference(spm,[status(thm)],[8,9,theory(equality)]) ).
cnf(14,negated_conjecture,
big_f(esk1_0,esk3_0),
inference(sr,[status(thm)],[10,13,theory(equality)]) ).
cnf(15,negated_conjecture,
big_f(esk1_0,f(esk1_0)),
inference(spm,[status(thm)],[11,14,theory(equality)]) ).
cnf(16,negated_conjecture,
$false,
inference(sr,[status(thm)],[15,13,theory(equality)]) ).
cnf(17,negated_conjecture,
$false,
16,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN082+1.p
% --creating new selector for []
% -running prover on /tmp/tmpCV5HC2/sel_SYN082+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN082+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN082+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN082+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
%
%------------------------------------------------------------------------------