TSTP Solution File: LCL682+1.001 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL682+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 : art06.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 20:37:12 EST 2010
% Result : Theorem 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 183 ( 0 equ)
% Maximal formula atoms : 24 ( 10 avg)
% Number of connectives : 284 ( 118 ~; 91 |; 75 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 88 ( 0 sgn 64 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p15(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p13(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p11(X1) ) ) ),
file('/tmp/tmp-mbrKy/sel_LCL682+1.001.p_1',main) ).
fof(4,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p15(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p13(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p11(X1) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(5,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p15(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p13(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| p11(X1) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(6,negated_conjecture,
? [X1] :
( ! [X2] :
( ~ r1(X1,X2)
| ( ! [X1] :
( ~ r1(X2,X1)
| p16(X1) )
& ! [X1] :
( ~ r1(X2,X1)
| p12(X1) )
& ! [X1] :
( ~ r1(X2,X1)
| p14(X1) )
& ! [X1] :
( ~ r1(X2,X1)
| p12(X1) ) ) )
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ~ p15(X1) ) )
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ~ p13(X1) ) )
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ~ p12(X1) ) )
& ? [X2] :
( r1(X1,X2)
& ? [X1] :
( r1(X2,X1)
& ~ p11(X1) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(7,negated_conjecture,
? [X3] :
( ! [X4] :
( ~ r1(X3,X4)
| ( ! [X5] :
( ~ r1(X4,X5)
| p16(X5) )
& ! [X6] :
( ~ r1(X4,X6)
| p12(X6) )
& ! [X7] :
( ~ r1(X4,X7)
| p14(X7) )
& ! [X8] :
( ~ r1(X4,X8)
| p12(X8) ) ) )
& ? [X9] :
( r1(X3,X9)
& ? [X10] :
( r1(X9,X10)
& ~ p15(X10) ) )
& ? [X11] :
( r1(X3,X11)
& ? [X12] :
( r1(X11,X12)
& ~ p13(X12) ) )
& ? [X13] :
( r1(X3,X13)
& ? [X14] :
( r1(X13,X14)
& ~ p12(X14) ) )
& ? [X15] :
( r1(X3,X15)
& ? [X16] :
( r1(X15,X16)
& ~ p11(X16) ) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,negated_conjecture,
( ! [X4] :
( ~ r1(esk1_0,X4)
| ( ! [X5] :
( ~ r1(X4,X5)
| p16(X5) )
& ! [X6] :
( ~ r1(X4,X6)
| p12(X6) )
& ! [X7] :
( ~ r1(X4,X7)
| p14(X7) )
& ! [X8] :
( ~ r1(X4,X8)
| p12(X8) ) ) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& ~ p15(esk3_0)
& r1(esk1_0,esk4_0)
& r1(esk4_0,esk5_0)
& ~ p13(esk5_0)
& r1(esk1_0,esk6_0)
& r1(esk6_0,esk7_0)
& ~ p12(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p11(esk9_0) ),
inference(skolemize,[status(esa)],[7]) ).
fof(9,negated_conjecture,
! [X4,X5,X6,X7,X8] :
( ( ( ( ~ r1(X4,X8)
| p12(X8) )
& ( ~ r1(X4,X7)
| p14(X7) )
& ( ~ r1(X4,X6)
| p12(X6) )
& ( ~ r1(X4,X5)
| p16(X5) ) )
| ~ r1(esk1_0,X4) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& ~ p15(esk3_0)
& r1(esk1_0,esk4_0)
& r1(esk4_0,esk5_0)
& ~ p13(esk5_0)
& r1(esk1_0,esk6_0)
& r1(esk6_0,esk7_0)
& ~ p12(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p11(esk9_0) ),
inference(shift_quantors,[status(thm)],[8]) ).
fof(10,negated_conjecture,
! [X4,X5,X6,X7,X8] :
( ( ~ r1(X4,X8)
| p12(X8)
| ~ r1(esk1_0,X4) )
& ( ~ r1(X4,X7)
| p14(X7)
| ~ r1(esk1_0,X4) )
& ( ~ r1(X4,X6)
| p12(X6)
| ~ r1(esk1_0,X4) )
& ( ~ r1(X4,X5)
| p16(X5)
| ~ r1(esk1_0,X4) )
& r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& ~ p15(esk3_0)
& r1(esk1_0,esk4_0)
& r1(esk4_0,esk5_0)
& ~ p13(esk5_0)
& r1(esk1_0,esk6_0)
& r1(esk6_0,esk7_0)
& ~ p12(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ~ p11(esk9_0) ),
inference(distribute,[status(thm)],[9]) ).
cnf(14,negated_conjecture,
~ p12(esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(15,negated_conjecture,
r1(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(16,negated_conjecture,
r1(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(24,negated_conjecture,
( p12(X2)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(39,negated_conjecture,
( p12(X1)
| ~ r1(esk6_0,X1) ),
inference(spm,[status(thm)],[24,16,theory(equality)]) ).
cnf(58,negated_conjecture,
~ r1(esk6_0,esk7_0),
inference(spm,[status(thm)],[14,39,theory(equality)]) ).
cnf(59,negated_conjecture,
$false,
inference(rw,[status(thm)],[58,15,theory(equality)]) ).
cnf(60,negated_conjecture,
$false,
inference(cn,[status(thm)],[59,theory(equality)]) ).
cnf(61,negated_conjecture,
$false,
60,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL682+1.001.p
% --creating new selector for []
% -running prover on /tmp/tmp-mbrKy/sel_LCL682+1.001.p_1 with time limit 29
% -prover status Theorem
% Problem LCL682+1.001.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL682+1.001.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL682+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
%
%------------------------------------------------------------------------------