TSTP Solution File: NUM326+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM326+1 : TPTP v7.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n032.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:08 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 12 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 7 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 19 ( 2 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X2,X3] :
( ( rdn_translate(X1,rdn_pos(X3))
& rdn_translate(X2,rdn_neg(X3)) )
=> sum(X1,X2,n0) ),
file('/export/starexec/sandbox/tmp/tmps4GFEM/sel_theBenchmark.p_1',sum_entry_point_posx_negx) ).
fof(21,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox/tmp/tmps4GFEM/sel_theBenchmark.p_1',rdnn5) ).
fof(45,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox/tmp/tmps4GFEM/sel_theBenchmark.p_1',rdn5) ).
fof(66,conjecture,
? [X4] : sum(X4,nn5,n0),
file('/export/starexec/sandbox/tmp/tmps4GFEM/sel_theBenchmark.p_1',sum_what_nn5_n0) ).
fof(67,negated_conjecture,
~ ? [X4] : sum(X4,nn5,n0),
inference(assume_negation,[status(cth)],[66]) ).
fof(72,plain,
! [X1,X2,X3] :
( ~ rdn_translate(X1,rdn_pos(X3))
| ~ rdn_translate(X2,rdn_neg(X3))
| sum(X1,X2,n0) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(73,plain,
! [X4,X5,X6] :
( ~ rdn_translate(X4,rdn_pos(X6))
| ~ rdn_translate(X5,rdn_neg(X6))
| sum(X4,X5,n0) ),
inference(variable_rename,[status(thm)],[72]) ).
cnf(74,plain,
( sum(X1,X2,n0)
| ~ rdn_translate(X2,rdn_neg(X3))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(split_conjunct,[status(thm)],[73]) ).
cnf(92,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(122,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[45]) ).
fof(143,negated_conjecture,
! [X4] : ~ sum(X4,nn5,n0),
inference(fof_nnf,[status(thm)],[67]) ).
fof(144,negated_conjecture,
! [X5] : ~ sum(X5,nn5,n0),
inference(variable_rename,[status(thm)],[143]) ).
cnf(145,negated_conjecture,
~ sum(X1,nn5,n0),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(146,plain,
( sum(X1,nn5,n0)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5))) ),
inference(spm,[status(thm)],[74,92,theory(equality)]) ).
cnf(147,plain,
~ rdn_translate(X1,rdn_pos(rdnn(n5))),
inference(sr,[status(thm)],[146,145,theory(equality)]) ).
cnf(156,plain,
$false,
inference(sr,[status(thm)],[122,147,theory(equality)]) ).
cnf(157,plain,
$false,
156,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM326+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 : n032.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:06:45 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/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/tmps4GFEM/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/tmps4GFEM/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
%------------------------------------------------------------------------------