TSTP Solution File: LCL896+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL896+1 : TPTP v5.5.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Mon Oct 22 18:23:51 EDT 2012
% Result : Theorem 15.63s
% Output : CNFRefutation 15.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 68 ( 41 unt; 0 def)
% Number of atoms : 103 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 65 ( 30 ~; 28 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 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 : 134 ( 5 sgn 55 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : '>='(X1,'0'),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_08) ).
fof(3,conjecture,
! [X5,X6] : equal('+'(X5,'==>'(X5,X6)),'+'(X6,'==>'(X6,X5))),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',goals_13) ).
fof(5,axiom,
! [X1] : equal('+'(X1,'0'),X1),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_03) ).
fof(6,axiom,
! [X1,X7,X8] : equal('+'('+'(X1,X7),X8),'+'(X1,'+'(X7,X8))),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_01) ).
fof(7,axiom,
! [X9,X10] :
( ( '>='(X9,X10)
& '>='(X10,X9) )
=> equal(X9,X10) ),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_06) ).
fof(8,axiom,
! [X11,X12,X13] :
( '>='('+'(X11,X12),X13)
<=> '>='(X12,'==>'(X11,X13)) ),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_07) ).
fof(9,axiom,
! [X1] : '>='(X1,X1),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_04) ).
fof(11,axiom,
! [X17,X18,X19] :
( '>='(X17,X18)
=> '>='('==>'(X19,X17),'==>'(X19,X18)) ),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_11) ).
fof(12,axiom,
! [X20,X21,X22] :
( '>='(X20,X21)
=> '>='('==>'(X21,X22),'==>'(X20,X22)) ),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_10) ).
fof(13,axiom,
! [X1,X7,X8] : equal('+'('+'(X1,'==>'(X1,X7)),'==>'('+'(X1,'==>'(X1,X7)),X8)),'+'(X1,'==>'(X1,'+'(X7,'==>'(X7,X8))))),
file('/tmp/tmps6dXA2/sel_LCL896+1.p_1',sos_12) ).
fof(14,negated_conjecture,
~ ! [X5,X6] : equal('+'(X5,'==>'(X5,X6)),'+'(X6,'==>'(X6,X5))),
inference(assume_negation,[status(cth)],[3]) ).
fof(15,plain,
! [X2] : '>='(X2,'0'),
inference(variable_rename,[status(thm)],[1]) ).
cnf(16,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[15]) ).
fof(20,negated_conjecture,
? [X5,X6] : ~ equal('+'(X5,'==>'(X5,X6)),'+'(X6,'==>'(X6,X5))),
inference(fof_nnf,[status(thm)],[14]) ).
fof(21,negated_conjecture,
? [X7,X8] : ~ equal('+'(X7,'==>'(X7,X8)),'+'(X8,'==>'(X8,X7))),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,negated_conjecture,
~ equal('+'(esk1_0,'==>'(esk1_0,esk2_0)),'+'(esk2_0,'==>'(esk2_0,esk1_0))),
inference(skolemize,[status(esa)],[21]) ).
cnf(23,negated_conjecture,
'+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[22]) ).
fof(26,plain,
! [X2] : equal('+'(X2,'0'),X2),
inference(variable_rename,[status(thm)],[5]) ).
cnf(27,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[26]) ).
fof(28,plain,
! [X9,X10,X11] : equal('+'('+'(X9,X10),X11),'+'(X9,'+'(X10,X11))),
inference(variable_rename,[status(thm)],[6]) ).
cnf(29,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X9,X10] :
( ~ '>='(X9,X10)
| ~ '>='(X10,X9)
| equal(X9,X10) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(31,plain,
! [X11,X12] :
( ~ '>='(X11,X12)
| ~ '>='(X12,X11)
| equal(X11,X12) ),
inference(variable_rename,[status(thm)],[30]) ).
cnf(32,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[31]) ).
fof(33,plain,
! [X11,X12,X13] :
( ( ~ '>='('+'(X11,X12),X13)
| '>='(X12,'==>'(X11,X13)) )
& ( ~ '>='(X12,'==>'(X11,X13))
| '>='('+'(X11,X12),X13) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(34,plain,
! [X14,X15,X16] :
( ( ~ '>='('+'(X14,X15),X16)
| '>='(X15,'==>'(X14,X16)) )
& ( ~ '>='(X15,'==>'(X14,X16))
| '>='('+'(X14,X15),X16) ) ),
inference(variable_rename,[status(thm)],[33]) ).
cnf(35,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(36,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(37,plain,
! [X2] : '>='(X2,X2),
inference(variable_rename,[status(thm)],[9]) ).
cnf(38,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[37]) ).
fof(42,plain,
! [X17,X18,X19] :
( ~ '>='(X17,X18)
| '>='('==>'(X19,X17),'==>'(X19,X18)) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(43,plain,
! [X20,X21,X22] :
( ~ '>='(X20,X21)
| '>='('==>'(X22,X20),'==>'(X22,X21)) ),
inference(variable_rename,[status(thm)],[42]) ).
cnf(44,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='(X2,X3) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(45,plain,
! [X20,X21,X22] :
( ~ '>='(X20,X21)
| '>='('==>'(X21,X22),'==>'(X20,X22)) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(46,plain,
! [X23,X24,X25] :
( ~ '>='(X23,X24)
| '>='('==>'(X24,X25),'==>'(X23,X25)) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( '>='('==>'(X1,X2),'==>'(X3,X2))
| ~ '>='(X3,X1) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(48,plain,
! [X9,X10,X11] : equal('+'('+'(X9,'==>'(X9,X10)),'==>'('+'(X9,'==>'(X9,X10)),X11)),'+'(X9,'==>'(X9,'+'(X10,'==>'(X10,X11))))),
inference(variable_rename,[status(thm)],[13]) ).
cnf(49,plain,
'+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(73,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[32,16,theory(equality)]) ).
cnf(78,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[36,38,theory(equality)]) ).
cnf(79,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[36,27,theory(equality)]) ).
cnf(83,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[35,38,theory(equality)]) ).
cnf(84,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3))) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
inference(rw,[status(thm)],[49,29,theory(equality)]) ).
cnf(96,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[79,38,theory(equality)]) ).
cnf(208,plain,
( '==>'(X1,X1) = '0'
| ~ '>='('==>'(X1,X1),'0') ),
inference(spm,[status(thm)],[32,96,theory(equality)]) ).
cnf(217,plain,
( '==>'(X1,X1) = '0'
| $false ),
inference(rw,[status(thm)],[208,16,theory(equality)]) ).
cnf(218,plain,
'==>'(X1,X1) = '0',
inference(cn,[status(thm)],[217,theory(equality)]) ).
cnf(223,plain,
'+'(X1,'==>'(X2,X2)) = X1,
inference(spm,[status(thm)],[27,218,theory(equality)]) ).
cnf(231,plain,
( '>='('+'(X1,X2),X1)
| ~ '>='(X2,'0') ),
inference(spm,[status(thm)],[35,218,theory(equality)]) ).
cnf(232,plain,
( '==>'(X2,X2) = X1
| ~ '>='('==>'(X2,X2),X1) ),
inference(spm,[status(thm)],[73,218,theory(equality)]) ).
cnf(236,plain,
( '>='('+'(X1,X2),X1)
| $false ),
inference(rw,[status(thm)],[231,16,theory(equality)]) ).
cnf(237,plain,
'>='('+'(X1,X2),X1),
inference(cn,[status(thm)],[236,theory(equality)]) ).
cnf(285,plain,
'>='('==>'(X1,X2),'==>'('+'(X1,X3),X2)),
inference(spm,[status(thm)],[47,237,theory(equality)]) ).
cnf(1038,plain,
( '==>'(X1,'+'(X1,X2)) = X2
| ~ '>='('==>'(X1,'+'(X1,X2)),X2) ),
inference(spm,[status(thm)],[32,78,theory(equality)]) ).
cnf(1314,plain,
'>='('==>'(X1,'+'(X2,'==>'(X2,X3))),'==>'(X1,X3)),
inference(spm,[status(thm)],[44,83,theory(equality)]) ).
cnf(8011,plain,
'==>'(X1,X1) = '==>'('+'(X1,X2),X1),
inference(spm,[status(thm)],[232,285,theory(equality)]) ).
cnf(8075,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'(X1,X1))) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))),
inference(spm,[status(thm)],[84,8011,theory(equality)]) ).
cnf(8164,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))),
inference(rw,[status(thm)],[8075,223,theory(equality)]) ).
cnf(54367,plain,
'==>'(X1,'+'(X1,'==>'(X1,X2))) = '==>'(X1,X2),
inference(spm,[status(thm)],[1038,1314,theory(equality)]) ).
cnf(54799,plain,
'==>'(X1,'+'(X1,'==>'(X1,X2))) = '==>'(X1,'+'(X2,'==>'(X2,X1))),
inference(spm,[status(thm)],[54367,8164,theory(equality)]) ).
cnf(55047,plain,
'==>'(X1,X2) = '==>'(X1,'+'(X2,'==>'(X2,X1))),
inference(rw,[status(thm)],[54799,54367,theory(equality)]) ).
cnf(56575,plain,
'>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1))),
inference(spm,[status(thm)],[83,55047,theory(equality)]) ).
cnf(441242,plain,
( '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1))
| ~ '>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1))) ),
inference(spm,[status(thm)],[32,56575,theory(equality)]) ).
cnf(441598,plain,
( '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1))
| $false ),
inference(rw,[status(thm)],[441242,56575,theory(equality)]) ).
cnf(441599,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(cn,[status(thm)],[441598,theory(equality)]) ).
cnf(444249,negated_conjecture,
$false,
inference(rw,[status(thm)],[23,441599,theory(equality)]) ).
cnf(444250,negated_conjecture,
$false,
inference(cn,[status(thm)],[444249,theory(equality)]) ).
cnf(444251,negated_conjecture,
$false,
444250,
[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/LCL896+1.p
% --creating new selector for []
% -running prover on /tmp/tmps6dXA2/sel_LCL896+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/tmps6dXA2/sel_LCL896+1.p_1']
% -prover status Theorem
% Problem LCL896+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL896+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL896+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
%
%------------------------------------------------------------------------------