TSTP Solution File: NUM298+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM298+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n140.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:02:05 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 57 ( 27 ~; 18 |; 9 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 3 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(11,axiom,
! [X1,X2,X3,X4] :
( ( rdn_translate(X1,rdn_neg(X3))
& rdn_translate(X2,rdn_pos(X4)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1',less_entry_point_neg_pos) ).
fof(56,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1',rdn2) ).
fof(78,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1',rdnn2) ).
fof(113,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1',less_property) ).
fof(127,conjecture,
~ less(n2,nn2),
file('/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1',n2_not_less_nn2) ).
fof(128,negated_conjecture,
~ ~ less(n2,nn2),
inference(assume_negation,[status(cth)],[127]) ).
fof(129,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[113,theory(equality)]) ).
fof(130,negated_conjecture,
less(n2,nn2),
inference(fof_simplification,[status(thm)],[128,theory(equality)]) ).
fof(141,plain,
! [X1,X2,X3,X4] :
( ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X2,rdn_pos(X4))
| less(X1,X2) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(142,plain,
! [X5,X6,X7,X8] :
( ~ rdn_translate(X5,rdn_neg(X7))
| ~ rdn_translate(X6,rdn_pos(X8))
| less(X5,X6) ),
inference(variable_rename,[status(thm)],[141]) ).
cnf(143,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
inference(split_conjunct,[status(thm)],[142]) ).
cnf(192,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(214,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[78]) ).
fof(251,plain,
! [X1,X2] :
( ( ~ less(X1,X2)
| ( ~ less(X2,X1)
& ~ equal(X2,X1) ) )
& ( less(X2,X1)
| equal(X2,X1)
| less(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[129]) ).
fof(252,plain,
! [X3,X4] :
( ( ~ less(X3,X4)
| ( ~ less(X4,X3)
& ~ equal(X4,X3) ) )
& ( less(X4,X3)
| equal(X4,X3)
| less(X3,X4) ) ),
inference(variable_rename,[status(thm)],[251]) ).
fof(253,plain,
! [X3,X4] :
( ( ~ less(X4,X3)
| ~ less(X3,X4) )
& ( ~ equal(X4,X3)
| ~ less(X3,X4) )
& ( less(X4,X3)
| equal(X4,X3)
| less(X3,X4) ) ),
inference(distribute,[status(thm)],[252]) ).
cnf(256,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[253]) ).
cnf(272,negated_conjecture,
less(n2,nn2),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(279,plain,
( less(X1,n2)
| ~ rdn_translate(X1,rdn_neg(X2)) ),
inference(spm,[status(thm)],[143,192,theory(equality)]) ).
cnf(318,plain,
less(nn2,n2),
inference(spm,[status(thm)],[279,214,theory(equality)]) ).
cnf(319,plain,
~ less(n2,nn2),
inference(spm,[status(thm)],[256,318,theory(equality)]) ).
cnf(320,plain,
$false,
inference(rw,[status(thm)],[319,272,theory(equality)]) ).
cnf(321,plain,
$false,
inference(cn,[status(thm)],[320,theory(equality)]) ).
cnf(322,plain,
$false,
321,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM298+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n140.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 00:39:29 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.28 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmpzosZtE/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------