TSTP Solution File: NUM295+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM295+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n074.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.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 70 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 75 ( 34 ~; 28 |; 10 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 56 ( 15 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(57,axiom,
rdn_translate(n3,rdn_pos(rdnn(n3))),
file('/export/starexec/sandbox/tmp/tmpsjS1zl/sel_theBenchmark.p_1',rdn3) ).
fof(63,axiom,
rdn_positive_less(rdnn(n7),rdnn(n8)),
file('/export/starexec/sandbox/tmp/tmpsjS1zl/sel_theBenchmark.p_1',rdn_positive_less78) ).
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/tmpsjS1zl/sel_theBenchmark.p_1',less_entry_point_pos_pos) ).
fof(112,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmpsjS1zl/sel_theBenchmark.p_1',less_property) ).
fof(126,conjecture,
? [X1,X2] : less(X1,X2),
file('/export/starexec/sandbox/tmp/tmpsjS1zl/sel_theBenchmark.p_1',something_less_something) ).
fof(127,negated_conjecture,
~ ? [X1,X2] : less(X1,X2),
inference(assume_negation,[status(cth)],[126]) ).
fof(128,plain,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& ~ equal(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[112,theory(equality)]) ).
cnf(189,plain,
rdn_translate(n3,rdn_pos(rdnn(n3))),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(195,plain,
rdn_positive_less(rdnn(n7),rdnn(n8)),
inference(split_conjunct,[status(thm)],[63]) ).
fof(234,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(235,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)],[234]) ).
cnf(236,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)],[235]) ).
fof(248,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)],[128]) ).
fof(249,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)],[248]) ).
fof(250,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)],[249]) ).
cnf(251,plain,
( less(X1,X2)
| X2 = X1
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[250]) ).
fof(269,negated_conjecture,
! [X1,X2] : ~ less(X1,X2),
inference(fof_nnf,[status(thm)],[127]) ).
fof(270,negated_conjecture,
! [X3,X4] : ~ less(X3,X4),
inference(variable_rename,[status(thm)],[269]) ).
cnf(271,negated_conjecture,
~ less(X1,X2),
inference(split_conjunct,[status(thm)],[270]) ).
cnf(272,plain,
( X1 = X2
| less(X1,X2) ),
inference(sr,[status(thm)],[251,271,theory(equality)]) ).
cnf(273,plain,
X1 = X2,
inference(sr,[status(thm)],[272,271,theory(equality)]) ).
cnf(348,plain,
rdn_translate(n3,X1),
inference(spm,[status(thm)],[189,273,theory(equality)]) ).
cnf(701,plain,
( ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(sr,[status(thm)],[236,271,theory(equality)]) ).
cnf(1838,plain,
rdn_translate(X2,X1),
inference(spm,[status(thm)],[348,273,theory(equality)]) ).
cnf(1873,plain,
( $false
| ~ rdn_translate(X3,rdn_pos(X4))
| ~ rdn_positive_less(X4,X2) ),
inference(rw,[status(thm)],[701,1838,theory(equality)]) ).
cnf(1874,plain,
( $false
| $false
| ~ rdn_positive_less(X4,X2) ),
inference(rw,[status(thm)],[1873,1838,theory(equality)]) ).
cnf(1875,plain,
~ rdn_positive_less(X4,X2),
inference(cn,[status(thm)],[1874,theory(equality)]) ).
cnf(1879,plain,
$false,
inference(sr,[status(thm)],[195,1875,theory(equality)]) ).
cnf(1880,plain,
$false,
1879,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM295+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.24 % Computer : n074.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 00:35:14 CST 2018
% 0.02/0.24 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for [NUM005+0.ax, NUM005+1.ax, NUM005+2.ax]
% 0.07/0.39 -running prover on /export/starexec/sandbox/tmp/tmpsjS1zl/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.39 -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/tmpsjS1zl/sel_theBenchmark.p_1']
% 0.07/0.39 -prover status Theorem
% 0.07/0.39 Problem theBenchmark.p solved in phase 0.
% 0.07/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.39 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.39 Solved 1 out of 1.
% 0.07/0.39 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.39 # SZS status Theorem
% 0.07/0.39 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------