TSTP Solution File: LCL646+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL646+1.001 : TPTP v5.0.0. Released v4.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 : Sat Dec 25 19:00:10 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 185 ( 79 ~; 62 |; 44 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 54 ( 0 sgn 40 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
file('/tmp/tmpt90S4t/sel_LCL646+1.001.p_1',main) ).
fof(2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| p6(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| p4(X2) )
& ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ? [X2] :
( r1(X1,X2)
& ~ p5(X2) )
& ? [X2] :
( r1(X1,X2)
& ~ p3(X2) )
& ? [X2] :
( r1(X1,X2)
& ~ p2(X2) )
& ? [X2] :
( r1(X1,X2)
& ~ p1(X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
? [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| p6(X4) )
& ! [X5] :
( ~ r1(X3,X5)
| p2(X5) )
& ! [X6] :
( ~ r1(X3,X6)
| p4(X6) )
& ! [X7] :
( ~ r1(X3,X7)
| p2(X7) )
& ? [X8] :
( r1(X3,X8)
& ~ p5(X8) )
& ? [X9] :
( r1(X3,X9)
& ~ p3(X9) )
& ? [X10] :
( r1(X3,X10)
& ~ p2(X10) )
& ? [X11] :
( r1(X3,X11)
& ~ p1(X11) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X4] :
( ~ r1(esk1_0,X4)
| p6(X4) )
& ! [X5] :
( ~ r1(esk1_0,X5)
| p2(X5) )
& ! [X6] :
( ~ r1(esk1_0,X6)
| p4(X6) )
& ! [X7] :
( ~ r1(esk1_0,X7)
| p2(X7) )
& r1(esk1_0,esk2_0)
& ~ p5(esk2_0)
& r1(esk1_0,esk3_0)
& ~ p3(esk3_0)
& r1(esk1_0,esk4_0)
& ~ p2(esk4_0)
& r1(esk1_0,esk5_0)
& ~ p1(esk5_0) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X4,X5,X6,X7] :
( ( ~ r1(esk1_0,X7)
| p2(X7) )
& ( ~ r1(esk1_0,X6)
| p4(X6) )
& ( ~ r1(esk1_0,X5)
| p2(X5) )
& ( ~ r1(esk1_0,X4)
| p6(X4) )
& r1(esk1_0,esk2_0)
& ~ p5(esk2_0)
& r1(esk1_0,esk3_0)
& ~ p3(esk3_0)
& r1(esk1_0,esk4_0)
& ~ p2(esk4_0)
& r1(esk1_0,esk5_0)
& ~ p1(esk5_0) ),
inference(shift_quantors,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
~ p2(esk4_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
r1(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(17,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(20,negated_conjecture,
~ r1(esk1_0,esk4_0),
inference(spm,[status(thm)],[10,17,theory(equality)]) ).
cnf(21,negated_conjecture,
$false,
inference(rw,[status(thm)],[20,11,theory(equality)]) ).
cnf(22,negated_conjecture,
$false,
inference(cn,[status(thm)],[21,theory(equality)]) ).
cnf(23,negated_conjecture,
$false,
22,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL646+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmpt90S4t/sel_LCL646+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL646+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL646+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL646+1.001.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
%
%------------------------------------------------------------------------------