TSTP Solution File: LCL899+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL899+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:24:23 EDT 2012
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 43 unt; 0 def)
% Number of atoms : 97 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 58 ( 27 ~; 26 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 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 : 89 ( 14 sgn 33 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : '>='(X1,'0'),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_08) ).
fof(3,axiom,
! [X1,X5] : equal('+'(X1,X5),'+'(X5,X1)),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_02) ).
fof(4,axiom,
! [X1] : equal('+'(X1,'0'),X1),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_03) ).
fof(5,axiom,
! [X1,X5] : equal('==>'('==>'(X1,X5),X5),'==>'('==>'(X5,X1),X1)),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_13) ).
fof(7,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> equal(X7,X8) ),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_06) ).
fof(8,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_07) ).
fof(9,axiom,
! [X1] : '>='(X1,X1),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_04) ).
fof(12,conjecture,
! [X18] : equal('==>'('==>'(X18,'1'),'1'),X18),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',goals_14) ).
fof(14,axiom,
! [X1] : equal('+'(X1,'1'),'1'),
file('/tmp/tmpdUFHFZ/sel_LCL899+1.p_1',sos_12) ).
fof(15,negated_conjecture,
~ ! [X18] : equal('==>'('==>'(X18,'1'),'1'),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,
! [X6,X7] : equal('==>'('==>'(X6,X7),X7),'==>'('==>'(X7,X6),X6)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(26,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
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(44,negated_conjecture,
? [X18] : ~ equal('==>'('==>'(X18,'1'),'1'),X18),
inference(fof_nnf,[status(thm)],[15]) ).
fof(45,negated_conjecture,
? [X19] : ~ equal('==>'('==>'(X19,'1'),'1'),X19),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,negated_conjecture,
~ equal('==>'('==>'(esk1_0,'1'),'1'),esk1_0),
inference(skolemize,[status(esa)],[45]) ).
cnf(47,negated_conjecture,
'==>'('==>'(esk1_0,'1'),'1') != esk1_0,
inference(split_conjunct,[status(thm)],[46]) ).
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(82,negated_conjecture,
'==>'('==>'('1',esk1_0),esk1_0) != esk1_0,
inference(rw,[status(thm)],[47,26,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(100,plain,
'>='('0','==>'(X1,'0')),
inference(spm,[status(thm)],[90,17,theory(equality)]) ).
cnf(101,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[90,37,theory(equality)]) ).
cnf(125,plain,
( '==>'(X1,'0') = '0'
| ~ '>='('==>'(X1,'0'),'0') ),
inference(spm,[status(thm)],[31,100,theory(equality)]) ).
cnf(133,plain,
( '==>'(X1,'0') = '0'
| $false ),
inference(rw,[status(thm)],[125,17,theory(equality)]) ).
cnf(134,plain,
'==>'(X1,'0') = '0',
inference(cn,[status(thm)],[133,theory(equality)]) ).
cnf(138,plain,
'==>'('0','0') = '==>'('==>'('0',X1),X1),
inference(spm,[status(thm)],[26,134,theory(equality)]) ).
cnf(144,plain,
'0' = '==>'('==>'('0',X1),X1),
inference(rw,[status(thm)],[138,134,theory(equality)]) ).
cnf(156,plain,
( '==>'(X1,X1) = '0'
| ~ '>='('==>'(X1,X1),'0') ),
inference(spm,[status(thm)],[31,101,theory(equality)]) ).
cnf(166,plain,
( '==>'(X1,X1) = '0'
| $false ),
inference(rw,[status(thm)],[156,17,theory(equality)]) ).
cnf(167,plain,
'==>'(X1,X1) = '0',
inference(cn,[status(thm)],[166,theory(equality)]) ).
cnf(180,plain,
( '>='('+'(X1,X2),X1)
| ~ '>='(X2,'0') ),
inference(spm,[status(thm)],[34,167,theory(equality)]) ).
cnf(183,plain,
( '>='('+'(X1,X2),X1)
| $false ),
inference(rw,[status(thm)],[180,17,theory(equality)]) ).
cnf(184,plain,
'>='('+'(X1,X2),X1),
inference(cn,[status(thm)],[183,theory(equality)]) ).
cnf(209,plain,
( '>='('+'('==>'('0',X1),X2),X1)
| ~ '>='(X2,'0') ),
inference(spm,[status(thm)],[34,144,theory(equality)]) ).
cnf(214,plain,
( '>='('+'('==>'('0',X1),X2),X1)
| $false ),
inference(rw,[status(thm)],[209,17,theory(equality)]) ).
cnf(215,plain,
'>='('+'('==>'('0',X1),X2),X1),
inference(cn,[status(thm)],[214,theory(equality)]) ).
cnf(378,plain,
'>='('1',X1),
inference(spm,[status(thm)],[184,52,theory(equality)]) ).
cnf(396,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[92,184,theory(equality)]) ).
cnf(408,plain,
'>='('0','==>'('1',X1)),
inference(spm,[status(thm)],[90,378,theory(equality)]) ).
cnf(423,plain,
( '==>'('1',X1) = '0'
| ~ '>='('==>'('1',X1),'0') ),
inference(spm,[status(thm)],[31,408,theory(equality)]) ).
cnf(433,plain,
( '==>'('1',X1) = '0'
| $false ),
inference(rw,[status(thm)],[423,17,theory(equality)]) ).
cnf(434,plain,
'==>'('1',X1) = '0',
inference(cn,[status(thm)],[433,theory(equality)]) ).
cnf(453,negated_conjecture,
'==>'('0',esk1_0) != esk1_0,
inference(rw,[status(thm)],[82,434,theory(equality)]) ).
cnf(1374,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[215,24,theory(equality)]) ).
cnf(1507,plain,
( X1 = '==>'('0',X1)
| ~ '>='(X1,'==>'('0',X1)) ),
inference(spm,[status(thm)],[31,1374,theory(equality)]) ).
cnf(1530,plain,
( X1 = '==>'('0',X1)
| $false ),
inference(rw,[status(thm)],[1507,396,theory(equality)]) ).
cnf(1531,plain,
X1 = '==>'('0',X1),
inference(cn,[status(thm)],[1530,theory(equality)]) ).
cnf(1562,negated_conjecture,
$false,
inference(rw,[status(thm)],[453,1531,theory(equality)]) ).
cnf(1563,negated_conjecture,
$false,
inference(cn,[status(thm)],[1562,theory(equality)]) ).
cnf(1564,negated_conjecture,
$false,
1563,
[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/LCL899+1.p
% --creating new selector for []
% -running prover on /tmp/tmpdUFHFZ/sel_LCL899+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/tmpdUFHFZ/sel_LCL899+1.p_1']
% -prover status Theorem
% Problem LCL899+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL899+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL899+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
%
%------------------------------------------------------------------------------