TSTP Solution File: SYN413+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN413+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:20:46 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 72 ( 28 ~; 20 |; 18 &)
% ( 3 <=>; 3 =>; 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 : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 40 ( 2 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
? [X2] :
! [X3] :
( f(X3,X2)
<=> ( f(X3,X1)
& ~ f(X3,X3) ) )
=> ~ ? [X4] :
! [X5] : f(X5,X4) ),
file('/tmp/tmpBSN5p-/sel_SYN413+1.p_1',kalish256) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
? [X2] :
! [X3] :
( f(X3,X2)
<=> ( f(X3,X1)
& ~ f(X3,X3) ) )
=> ~ ? [X4] :
! [X5] : f(X5,X4) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ! [X1] :
? [X2] :
! [X3] :
( f(X3,X2)
<=> ( f(X3,X1)
& ~ f(X3,X3) ) )
=> ~ ? [X4] :
! [X5] : f(X5,X4) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ! [X1] :
? [X2] :
! [X3] :
( ( ~ f(X3,X2)
| ( f(X3,X1)
& ~ f(X3,X3) ) )
& ( ~ f(X3,X1)
| f(X3,X3)
| f(X3,X2) ) )
& ? [X4] :
! [X5] : f(X5,X4) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X6] :
? [X7] :
! [X8] :
( ( ~ f(X8,X7)
| ( f(X8,X6)
& ~ f(X8,X8) ) )
& ( ~ f(X8,X6)
| f(X8,X8)
| f(X8,X7) ) )
& ? [X9] :
! [X10] : f(X10,X9) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X6,X8] :
( ( ~ f(X8,esk1_1(X6))
| ( f(X8,X6)
& ~ f(X8,X8) ) )
& ( ~ f(X8,X6)
| f(X8,X8)
| f(X8,esk1_1(X6)) ) )
& ! [X10] : f(X10,esk2_0) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X6,X8,X10] :
( f(X10,esk2_0)
& ( ~ f(X8,esk1_1(X6))
| ( f(X8,X6)
& ~ f(X8,X8) ) )
& ( ~ f(X8,X6)
| f(X8,X8)
| f(X8,esk1_1(X6)) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,negated_conjecture,
! [X6,X8,X10] :
( f(X10,esk2_0)
& ( f(X8,X6)
| ~ f(X8,esk1_1(X6)) )
& ( ~ f(X8,X8)
| ~ f(X8,esk1_1(X6)) )
& ( ~ f(X8,X6)
| f(X8,X8)
| f(X8,esk1_1(X6)) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( f(X1,esk1_1(X2))
| f(X1,X1)
| ~ f(X1,X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(10,negated_conjecture,
( ~ f(X1,esk1_1(X2))
| ~ f(X1,X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(12,negated_conjecture,
f(X1,esk2_0),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(13,negated_conjecture,
( f(X1,esk1_1(esk2_0))
| f(X1,X1) ),
inference(spm,[status(thm)],[9,12,theory(equality)]) ).
cnf(14,negated_conjecture,
f(esk1_1(esk2_0),esk1_1(esk2_0)),
inference(ef,[status(thm)],[13,theory(equality)]) ).
cnf(24,negated_conjecture,
~ f(esk1_1(esk2_0),esk1_1(esk2_0)),
inference(spm,[status(thm)],[10,14,theory(equality)]) ).
cnf(27,negated_conjecture,
$false,
inference(rw,[status(thm)],[24,14,theory(equality)]) ).
cnf(28,negated_conjecture,
$false,
inference(cn,[status(thm)],[27,theory(equality)]) ).
cnf(29,negated_conjecture,
$false,
28,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN413+1.p
% --creating new selector for []
% -running prover on /tmp/tmpBSN5p-/sel_SYN413+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN413+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN413+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN413+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
%
%------------------------------------------------------------------------------