TSTP Solution File: LCL903+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL903+1 : TPTP v5.5.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Mon Oct 22 18:25:02 EDT 2012
% Result : Theorem 0.87s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 11
% Syntax : Number of formulae : 79 ( 48 unt; 0 def)
% Number of atoms : 118 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 31 ~; 32 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 129 ( 11 sgn 49 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : '>='(X1,'0'),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_08) ).
fof(3,axiom,
! [X1,X5] : equal('+'(X1,X5),'+'(X5,X1)),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_02) ).
fof(4,axiom,
! [X1] : equal('+'(X1,'0'),X1),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_03) ).
fof(5,axiom,
! [X1] : equal('==>'('==>'('==>'(X1,'1'),X1),X1),'0'),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_13) ).
fof(7,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> equal(X7,X8) ),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_06) ).
fof(8,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_07) ).
fof(9,axiom,
! [X1] : '>='(X1,X1),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_04) ).
fof(11,axiom,
! [X15,X16,X17] :
( '>='(X15,X16)
=> '>='('==>'(X17,X15),'==>'(X17,X16)) ),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_11) ).
fof(12,conjecture,
! [X18] : equal('+'(X18,X18),X18),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',goals_14) ).
fof(13,axiom,
! [X19,X20,X21] :
( '>='(X19,X20)
=> '>='('==>'(X20,X21),'==>'(X19,X21)) ),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_10) ).
fof(14,axiom,
! [X1] : equal('+'(X1,'1'),'1'),
file('/tmp/tmpJO248H/sel_LCL903+1.p_1',sos_12) ).
fof(15,negated_conjecture,
~ ! [X18] : equal('+'(X18,X18),X18),
inference(assume_negation,[status(cth)],[12]) ).
fof(16,plain,
! [X2] : '>='(X2,'0'),
inference(variable_rename,[status(thm)],[1]) ).
cnf(17,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[16]) ).
fof(21,plain,
! [X6,X7] : equal('+'(X6,X7),'+'(X7,X6)),
inference(variable_rename,[status(thm)],[3]) ).
cnf(22,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X2] : equal('+'(X2,'0'),X2),
inference(variable_rename,[status(thm)],[4]) ).
cnf(24,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[23]) ).
fof(25,plain,
! [X2] : equal('==>'('==>'('==>'(X2,'1'),X2),X2),'0'),
inference(variable_rename,[status(thm)],[5]) ).
cnf(26,plain,
'==>'('==>'('==>'(X1,'1'),X1),X1) = '0',
inference(split_conjunct,[status(thm)],[25]) ).
fof(29,plain,
! [X7,X8] :
( ~ '>='(X7,X8)
| ~ '>='(X8,X7)
| equal(X7,X8) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(30,plain,
! [X9,X10] :
( ~ '>='(X9,X10)
| ~ '>='(X10,X9)
| equal(X9,X10) ),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X9,X10,X11] :
( ( ~ '>='('+'(X9,X10),X11)
| '>='(X10,'==>'(X9,X11)) )
& ( ~ '>='(X10,'==>'(X9,X11))
| '>='('+'(X9,X10),X11) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(33,plain,
! [X12,X13,X14] :
( ( ~ '>='('+'(X12,X13),X14)
| '>='(X13,'==>'(X12,X14)) )
& ( ~ '>='(X13,'==>'(X12,X14))
| '>='('+'(X12,X13),X14) ) ),
inference(variable_rename,[status(thm)],[32]) ).
cnf(34,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(35,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(36,plain,
! [X2] : '>='(X2,X2),
inference(variable_rename,[status(thm)],[9]) ).
cnf(37,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[36]) ).
fof(41,plain,
! [X15,X16,X17] :
( ~ '>='(X15,X16)
| '>='('==>'(X17,X15),'==>'(X17,X16)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(42,plain,
! [X18,X19,X20] :
( ~ '>='(X18,X19)
| '>='('==>'(X20,X18),'==>'(X20,X19)) ),
inference(variable_rename,[status(thm)],[41]) ).
cnf(43,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='(X2,X3) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(44,negated_conjecture,
? [X18] : ~ equal('+'(X18,X18),X18),
inference(fof_nnf,[status(thm)],[15]) ).
fof(45,negated_conjecture,
? [X19] : ~ equal('+'(X19,X19),X19),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,negated_conjecture,
~ equal('+'(esk1_0,esk1_0),esk1_0),
inference(skolemize,[status(esa)],[45]) ).
cnf(47,negated_conjecture,
'+'(esk1_0,esk1_0) != esk1_0,
inference(split_conjunct,[status(thm)],[46]) ).
fof(48,plain,
! [X19,X20,X21] :
( ~ '>='(X19,X20)
| '>='('==>'(X20,X21),'==>'(X19,X21)) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(49,plain,
! [X22,X23,X24] :
( ~ '>='(X22,X23)
| '>='('==>'(X23,X24),'==>'(X22,X24)) ),
inference(variable_rename,[status(thm)],[48]) ).
cnf(50,plain,
( '>='('==>'(X1,X2),'==>'(X3,X2))
| ~ '>='(X3,X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(51,plain,
! [X2] : equal('+'(X2,'1'),'1'),
inference(variable_rename,[status(thm)],[14]) ).
cnf(52,plain,
'+'(X1,'1') = '1',
inference(split_conjunct,[status(thm)],[51]) ).
cnf(60,plain,
'+'(X1,'==>'('==>'('==>'(X2,'1'),X2),X2)) = X1,
inference(spm,[status(thm)],[24,26,theory(equality)]) ).
cnf(89,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[35,37,theory(equality)]) ).
cnf(90,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[35,24,theory(equality)]) ).
cnf(92,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(spm,[status(thm)],[35,22,theory(equality)]) ).
cnf(94,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[34,37,theory(equality)]) ).
cnf(103,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[90,37,theory(equality)]) ).
cnf(174,plain,
( '==>'(X1,X1) = '0'
| ~ '>='('==>'(X1,X1),'0') ),
inference(spm,[status(thm)],[31,103,theory(equality)]) ).
cnf(184,plain,
( '==>'(X1,X1) = '0'
| $false ),
inference(rw,[status(thm)],[174,17,theory(equality)]) ).
cnf(185,plain,
'==>'(X1,X1) = '0',
inference(cn,[status(thm)],[184,theory(equality)]) ).
cnf(197,plain,
( '>='('+'(X1,X2),X1)
| ~ '>='(X2,'0') ),
inference(spm,[status(thm)],[34,185,theory(equality)]) ).
cnf(200,plain,
( '>='('+'(X1,X2),X1)
| $false ),
inference(rw,[status(thm)],[197,17,theory(equality)]) ).
cnf(201,plain,
'>='('+'(X1,X2),X1),
inference(cn,[status(thm)],[200,theory(equality)]) ).
cnf(322,plain,
'>='('1',X1),
inference(spm,[status(thm)],[201,52,theory(equality)]) ).
cnf(340,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[92,201,theory(equality)]) ).
cnf(349,plain,
'>='('==>'(X1,'1'),'==>'(X1,X2)),
inference(spm,[status(thm)],[43,322,theory(equality)]) ).
cnf(1454,plain,
'>='('==>'('==>'(X1,X2),X3),'==>'('==>'(X1,'1'),X3)),
inference(spm,[status(thm)],[50,349,theory(equality)]) ).
cnf(1508,plain,
'>='('0','==>'(X1,'==>'(X2,'+'(X2,X1)))),
inference(spm,[status(thm)],[90,89,theory(equality)]) ).
cnf(1858,plain,
'>='('==>'('==>'(X1,'1'),X1),X1),
inference(spm,[status(thm)],[94,60,theory(equality)]) ).
cnf(3027,plain,
( X1 = '==>'('==>'(X1,'1'),X1)
| ~ '>='(X1,'==>'('==>'(X1,'1'),X1)) ),
inference(spm,[status(thm)],[31,1858,theory(equality)]) ).
cnf(3062,plain,
( X1 = '==>'('==>'(X1,'1'),X1)
| $false ),
inference(rw,[status(thm)],[3027,340,theory(equality)]) ).
cnf(3063,plain,
X1 = '==>'('==>'(X1,'1'),X1),
inference(cn,[status(thm)],[3062,theory(equality)]) ).
cnf(12803,plain,
( '==>'(X1,'==>'(X2,'+'(X2,X1))) = '0'
| ~ '>='('==>'(X1,'==>'(X2,'+'(X2,X1))),'0') ),
inference(spm,[status(thm)],[31,1508,theory(equality)]) ).
cnf(12848,plain,
( '==>'(X1,'==>'(X2,'+'(X2,X1))) = '0'
| $false ),
inference(rw,[status(thm)],[12803,17,theory(equality)]) ).
cnf(12849,plain,
'==>'(X1,'==>'(X2,'+'(X2,X1))) = '0',
inference(cn,[status(thm)],[12848,theory(equality)]) ).
cnf(34853,plain,
'>='('==>'('==>'(X1,X2),X1),X1),
inference(spm,[status(thm)],[1454,3063,theory(equality)]) ).
cnf(35366,plain,
( X1 = '==>'('==>'(X1,X2),X1)
| ~ '>='(X1,'==>'('==>'(X1,X2),X1)) ),
inference(spm,[status(thm)],[31,34853,theory(equality)]) ).
cnf(35478,plain,
( X1 = '==>'('==>'(X1,X2),X1)
| $false ),
inference(rw,[status(thm)],[35366,340,theory(equality)]) ).
cnf(35479,plain,
X1 = '==>'('==>'(X1,X2),X1),
inference(cn,[status(thm)],[35478,theory(equality)]) ).
cnf(35644,plain,
'==>'(X1,'==>'(X1,X2)) = '==>'(X1,X2),
inference(spm,[status(thm)],[35479,35479,theory(equality)]) ).
cnf(36635,plain,
'==>'(X1,'+'(X1,X1)) = '0',
inference(spm,[status(thm)],[12849,35644,theory(equality)]) ).
cnf(37037,plain,
'>='('+'(X1,'0'),'+'(X1,X1)),
inference(spm,[status(thm)],[94,36635,theory(equality)]) ).
cnf(37175,plain,
'>='(X1,'+'(X1,X1)),
inference(rw,[status(thm)],[37037,24,theory(equality)]) ).
cnf(37384,plain,
( '+'(X1,X1) = X1
| ~ '>='('+'(X1,X1),X1) ),
inference(spm,[status(thm)],[31,37175,theory(equality)]) ).
cnf(37455,plain,
( '+'(X1,X1) = X1
| $false ),
inference(rw,[status(thm)],[37384,201,theory(equality)]) ).
cnf(37456,plain,
'+'(X1,X1) = X1,
inference(cn,[status(thm)],[37455,theory(equality)]) ).
cnf(37713,negated_conjecture,
$false,
inference(rw,[status(thm)],[47,37456,theory(equality)]) ).
cnf(37714,negated_conjecture,
$false,
inference(cn,[status(thm)],[37713,theory(equality)]) ).
cnf(37715,negated_conjecture,
$false,
37714,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/LCL/LCL903+1.p
% --creating new selector for []
% -running prover on /tmp/tmpJO248H/sel_LCL903+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpJO248H/sel_LCL903+1.p_1']
% -prover status Theorem
% Problem LCL903+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL903+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL903+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
%
%------------------------------------------------------------------------------