TSTP Solution File: NUM299+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM299+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n105.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 : 8
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 85 ( 40 ~; 30 |; 11 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 43 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(35,axiom,
! [X1,X2,X3,X4] :
( ( rdn_translate(X1,rdn_neg(X3))
& rdn_translate(X2,rdn_neg(X4))
& rdn_positive_less(X4,X3) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',less_entry_point_neg_neg) ).
fof(78,axiom,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',rdnn4) ).
fof(79,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',rdnn2) ).
fof(111,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',rdn_positive_less23) ).
fof(114,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',less_property) ).
fof(125,axiom,
! [X1,X2,X9] :
( ( rdn_positive_less(rdnn(X1),rdnn(X2))
& rdn_positive_less(rdnn(X2),rdnn(X9)) )
=> rdn_positive_less(rdnn(X1),rdnn(X9)) ),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',rdn_positive_less_transitivity) ).
fof(126,axiom,
rdn_positive_less(rdnn(n3),rdnn(n4)),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',rdn_positive_less34) ).
fof(128,conjecture,
~ less(nn2,nn4),
file('/export/starexec/sandbox/tmp/tmpYXPzxL/sel_theBenchmark.p_1',nn2_not_less_nn4) ).
fof(129,negated_conjecture,
~ ~ less(nn2,nn4),
inference(assume_negation,[status(cth)],[128]) ).
fof(130,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[114,theory(equality)]) ).
fof(131,negated_conjecture,
less(nn2,nn4),
inference(fof_simplification,[status(thm)],[129,theory(equality)]) ).
fof(168,plain,
! [X1,X2,X3,X4] :
( ~ rdn_translate(X1,rdn_neg(X3))
| ~ rdn_translate(X2,rdn_neg(X4))
| ~ rdn_positive_less(X4,X3)
| less(X1,X2) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(169,plain,
! [X5,X6,X7,X8] :
( ~ rdn_translate(X5,rdn_neg(X7))
| ~ rdn_translate(X6,rdn_neg(X8))
| ~ rdn_positive_less(X8,X7)
| less(X5,X6) ),
inference(variable_rename,[status(thm)],[168]) ).
cnf(170,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
inference(split_conjunct,[status(thm)],[169]) ).
cnf(213,plain,
rdn_translate(nn4,rdn_neg(rdnn(n4))),
inference(split_conjunct,[status(thm)],[78]) ).
cnf(214,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[79]) ).
cnf(250,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[111]) ).
fof(253,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)],[130]) ).
fof(254,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)],[253]) ).
fof(255,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)],[254]) ).
cnf(258,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(split_conjunct,[status(thm)],[255]) ).
fof(269,plain,
! [X1,X2,X9] :
( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X2),rdnn(X9))
| rdn_positive_less(rdnn(X1),rdnn(X9)) ),
inference(fof_nnf,[status(thm)],[125]) ).
fof(270,plain,
! [X10,X11,X12] :
( ~ rdn_positive_less(rdnn(X10),rdnn(X11))
| ~ rdn_positive_less(rdnn(X11),rdnn(X12))
| rdn_positive_less(rdnn(X10),rdnn(X12)) ),
inference(variable_rename,[status(thm)],[269]) ).
cnf(271,plain,
( rdn_positive_less(rdnn(X1),rdnn(X2))
| ~ rdn_positive_less(rdnn(X3),rdnn(X2))
| ~ rdn_positive_less(rdnn(X1),rdnn(X3)) ),
inference(split_conjunct,[status(thm)],[270]) ).
cnf(272,plain,
rdn_positive_less(rdnn(n3),rdnn(n4)),
inference(split_conjunct,[status(thm)],[126]) ).
cnf(274,negated_conjecture,
less(nn2,nn4),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(276,negated_conjecture,
~ less(nn4,nn2),
inference(spm,[status(thm)],[258,274,theory(equality)]) ).
cnf(292,plain,
( less(X1,nn2)
| ~ rdn_translate(X1,rdn_neg(X2))
| ~ rdn_positive_less(rdnn(n2),X2) ),
inference(spm,[status(thm)],[170,214,theory(equality)]) ).
cnf(303,plain,
( rdn_positive_less(rdnn(X1),rdnn(n4))
| ~ rdn_positive_less(rdnn(X1),rdnn(n3)) ),
inference(spm,[status(thm)],[271,272,theory(equality)]) ).
cnf(365,plain,
( less(nn4,nn2)
| ~ rdn_positive_less(rdnn(n2),rdnn(n4)) ),
inference(spm,[status(thm)],[292,213,theory(equality)]) ).
cnf(367,plain,
~ rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(sr,[status(thm)],[365,276,theory(equality)]) ).
cnf(539,plain,
rdn_positive_less(rdnn(n2),rdnn(n4)),
inference(spm,[status(thm)],[303,250,theory(equality)]) ).
cnf(540,plain,
$false,
inference(sr,[status(thm)],[539,367,theory(equality)]) ).
cnf(541,plain,
$false,
540,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM299+1 : TPTP v7.0.0. Released v3.1.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n105.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:38:00 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for [NUM005+1.ax, NUM005+0.ax, NUM005+2.ax]
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmpYXPzxL/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/tmpYXPzxL/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.38 # SZS output end CNFRefutation
%------------------------------------------------------------------------------