TSTP Solution File: LCL893+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : LCL893+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:23:37 EDT 2012
% Result : Theorem 0.15s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 20 unt; 0 def)
% Number of atoms : 60 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 18 ~; 14 |; 6 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 1 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] :
( '>='('+'(X1,X2),X3)
<=> '>='(X2,'==>'(X1,X3)) ),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_08) ).
fof(2,axiom,
! [X4] : '>='(X4,'0'),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_09) ).
fof(4,axiom,
! [X4] : equal('+'(X4,'0'),X4),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_03) ).
fof(8,axiom,
! [X10,X11] :
( ( '>='(X10,X11)
& '>='(X11,X10) )
=> equal(X10,X11) ),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_07) ).
fof(10,axiom,
! [X4] : '>='(X4,X4),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_05) ).
fof(12,conjecture,
! [X15] :
( equal(h(X15),X15)
=> equal(X15,'0') ),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',goals_15) ).
fof(15,axiom,
! [X4] : equal(h(X4),'==>'(h(X4),X4)),
file('/tmp/tmpFxmhBC/sel_LCL893+1.p_1',sos_14) ).
fof(16,negated_conjecture,
~ ! [X15] :
( equal(h(X15),X15)
=> equal(X15,'0') ),
inference(assume_negation,[status(cth)],[12]) ).
fof(17,plain,
! [X1,X2,X3] :
( ( ~ '>='('+'(X1,X2),X3)
| '>='(X2,'==>'(X1,X3)) )
& ( ~ '>='(X2,'==>'(X1,X3))
| '>='('+'(X1,X2),X3) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(18,plain,
! [X4,X5,X6] :
( ( ~ '>='('+'(X4,X5),X6)
| '>='(X5,'==>'(X4,X6)) )
& ( ~ '>='(X5,'==>'(X4,X6))
| '>='('+'(X4,X5),X6) ) ),
inference(variable_rename,[status(thm)],[17]) ).
cnf(20,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(21,plain,
! [X5] : '>='(X5,'0'),
inference(variable_rename,[status(thm)],[2]) ).
cnf(22,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[21]) ).
fof(25,plain,
! [X5] : equal('+'(X5,'0'),X5),
inference(variable_rename,[status(thm)],[4]) ).
cnf(26,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[25]) ).
fof(34,plain,
! [X10,X11] :
( ~ '>='(X10,X11)
| ~ '>='(X11,X10)
| equal(X10,X11) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(35,plain,
! [X12,X13] :
( ~ '>='(X12,X13)
| ~ '>='(X13,X12)
| equal(X12,X13) ),
inference(variable_rename,[status(thm)],[34]) ).
cnf(36,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(39,plain,
! [X5] : '>='(X5,X5),
inference(variable_rename,[status(thm)],[10]) ).
cnf(40,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[39]) ).
fof(44,negated_conjecture,
? [X15] :
( equal(h(X15),X15)
& ~ equal(X15,'0') ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(45,negated_conjecture,
? [X16] :
( equal(h(X16),X16)
& ~ equal(X16,'0') ),
inference(variable_rename,[status(thm)],[44]) ).
fof(46,negated_conjecture,
( equal(h(esk1_0),esk1_0)
& ~ equal(esk1_0,'0') ),
inference(skolemize,[status(esa)],[45]) ).
cnf(47,negated_conjecture,
esk1_0 != '0',
inference(split_conjunct,[status(thm)],[46]) ).
cnf(48,negated_conjecture,
h(esk1_0) = esk1_0,
inference(split_conjunct,[status(thm)],[46]) ).
fof(55,plain,
! [X5] : equal(h(X5),'==>'(h(X5),X5)),
inference(variable_rename,[status(thm)],[15]) ).
cnf(56,plain,
h(X1) = '==>'(h(X1),X1),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(57,negated_conjecture,
'==>'(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[56,48,theory(equality)]) ).
cnf(89,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[20,26,theory(equality)]) ).
cnf(110,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[89,40,theory(equality)]) ).
cnf(198,negated_conjecture,
'>='('0',esk1_0),
inference(spm,[status(thm)],[110,57,theory(equality)]) ).
cnf(221,negated_conjecture,
( esk1_0 = '0'
| ~ '>='(esk1_0,'0') ),
inference(spm,[status(thm)],[36,198,theory(equality)]) ).
cnf(228,negated_conjecture,
( esk1_0 = '0'
| $false ),
inference(rw,[status(thm)],[221,22,theory(equality)]) ).
cnf(229,negated_conjecture,
esk1_0 = '0',
inference(cn,[status(thm)],[228,theory(equality)]) ).
cnf(230,negated_conjecture,
$false,
inference(sr,[status(thm)],[229,47,theory(equality)]) ).
cnf(231,negated_conjecture,
$false,
230,
[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/LCL893+1.p
% --creating new selector for []
% -running prover on /tmp/tmpFxmhBC/sel_LCL893+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/tmpFxmhBC/sel_LCL893+1.p_1']
% -prover status Theorem
% Problem LCL893+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/LCL/LCL893+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/LCL/LCL893+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
%
%------------------------------------------------------------------------------