%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM343+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n132.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:10 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 43 ( 1 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 49 ( 20 ~; 11 |; 14 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 1 sgn 12 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(119,axiom,
! [X5,X6] :
( less(X5,X6)
<=> ( ~ less(X6,X5)
& ~ equal(X6,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp7K42er/sel_theBenchmark.p_1',less_property) ).
fof(133,conjecture,
? [X5] :
( ( less(nn1,X5)
& less(X5,n1) )
=> sum(n21,X5,n21) ),
file('/export/starexec/sandbox/tmp/tmp7K42er/sel_theBenchmark.p_1',sum_something_n0_samething) ).
fof(134,negated_conjecture,
~ ? [X5] :
( ( less(nn1,X5)
& less(X5,n1) )
=> sum(n21,X5,n21) ),
inference(assume_negation,[status(cth)],[133]) ).
fof(135,plain,
! [X5,X6] :
( less(X5,X6)
<=> ( ~ less(X6,X5)
& ~ equal(X6,X5) ) ),
inference(fof_simplification,[status(thm)],[119,theory(equality)]) ).
fof(272,plain,
! [X5,X6] :
( ( ~ less(X5,X6)
| ( ~ less(X6,X5)
& ~ equal(X6,X5) ) )
& ( less(X6,X5)
| equal(X6,X5)
| less(X5,X6) ) ),
inference(fof_nnf,[status(thm)],[135]) ).
fof(273,plain,
! [X7,X8] :
( ( ~ less(X7,X8)
| ( ~ less(X8,X7)
& ~ equal(X8,X7) ) )
& ( less(X8,X7)
| equal(X8,X7)
| less(X7,X8) ) ),
inference(variable_rename,[status(thm)],[272]) ).
fof(274,plain,
! [X7,X8] :
( ( ~ less(X8,X7)
| ~ less(X7,X8) )
& ( ~ equal(X8,X7)
| ~ less(X7,X8) )
& ( less(X8,X7)
| equal(X8,X7)
| less(X7,X8) ) ),
inference(distribute,[status(thm)],[273]) ).
cnf(276,plain,
( ~ less(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[274]) ).
fof(293,negated_conjecture,
! [X5] :
( less(nn1,X5)
& less(X5,n1)
& ~ sum(n21,X5,n21) ),
inference(fof_nnf,[status(thm)],[134]) ).
fof(294,negated_conjecture,
! [X6] :
( less(nn1,X6)
& less(X6,n1)
& ~ sum(n21,X6,n21) ),
inference(variable_rename,[status(thm)],[293]) ).
cnf(296,negated_conjecture,
less(X1,n1),
inference(split_conjunct,[status(thm)],[294]) ).
cnf(298,plain,
~ less(X1,X1),
inference(er,[status(thm)],[276,theory(equality)]) ).
cnf(351,negated_conjecture,
$false,
inference(spm,[status(thm)],[298,296,theory(equality)]) ).
cnf(353,negated_conjecture,
$false,
351,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM343+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 : n132.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 01:21:30 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+0.ax, NUM005+1.ax, NUM005+2.ax]
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmp7K42er/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/tmp7K42er/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
%------------------------------------------------------------------------------