TSTP Solution File: NUM290+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM290+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n138.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:04 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 : 20 ( 13 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 13 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(56,axiom,
rdn_translate(n2,rdn_pos(rdnn(n2))),
file('/export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1',rdn2) ).
fof(57,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1',rdn3) ).
fof(100,axiom,
! [X1,X2,X3,X4] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X2,rdn_pos(X4))
& rdn_positive_less(X3,X4) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1',less_entry_point_pos_pos) ).
fof(109,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1',rdn_positive_less23) ).
fof(126,conjecture,
less(n2,n3),
file('/export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1',n2_less_n3) ).
fof(127,negated_conjecture,
~ less(n2,n3),
inference(assume_negation,[status(cth)],[126]) ).
fof(129,negated_conjecture,
~ less(n2,n3),
inference(fof_simplification,[status(thm)],[127,theory(equality)]) ).
cnf(191,plain,
rdn_translate(n2,rdn_pos(rdnn(n2))),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(192,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[57]) ).
fof(235,plain,
! [X1,X2,X3,X4] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_positive_less(X3,X4)
| less(X1,X2) ),
inference(fof_nnf,[status(thm)],[100]) ).
fof(236,plain,
! [X5,X6,X7,X8] :
( ~ rdn_translate(X5,rdn_pos(X7))
| ~ rdn_translate(X6,rdn_pos(X8))
| ~ rdn_positive_less(X7,X8)
| less(X5,X6) ),
inference(variable_rename,[status(thm)],[235]) ).
cnf(237,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(split_conjunct,[status(thm)],[236]) ).
cnf(246,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(270,negated_conjecture,
~ less(n2,n3),
inference(split_conjunct,[status(thm)],[129]) ).
cnf(288,plain,
( less(X1,n3)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_positive_less(X2,rdnn(n3)) ),
inference(spm,[status(thm)],[237,192,theory(equality)]) ).
cnf(319,plain,
( less(n2,n3)
| ~ rdn_positive_less(rdnn(n2),rdnn(n3)) ),
inference(spm,[status(thm)],[288,191,theory(equality)]) ).
cnf(329,plain,
( less(n2,n3)
| $false ),
inference(rw,[status(thm)],[319,246,theory(equality)]) ).
cnf(330,plain,
less(n2,n3),
inference(cn,[status(thm)],[329,theory(equality)]) ).
cnf(331,plain,
$false,
inference(sr,[status(thm)],[330,270,theory(equality)]) ).
cnf(332,plain,
$false,
331,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM290+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 : n138.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 : Mon Jan 8 08:11:27 CST 2018
% 0.02/0.23 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 0.06/0.36 -running prover on /export/starexec/sandbox/tmp/tmpd5OXIM/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.36 -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/tmpd5OXIM/sel_theBenchmark.p_1']
% 0.06/0.36 -prover status Theorem
% 0.06/0.36 Problem theBenchmark.p solved in phase 0.
% 0.06/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.36 % 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
%------------------------------------------------------------------------------