%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM341+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:23:44 PM UTC 2026
% Result : Theorem 1.69s 1.27s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 1 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 57 ( 23 ~; 22 |; 8 &)
% ( 3 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 45 ( 0 sgn 39 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f296,axiom,
! [X0,X1,X2] :
( sum(X1,X2,X0)
<=> difference(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',minus_entry_point) ).
fof(f402,conjecture,
? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_same_as_subtract) ).
fof(f403,negated_conjecture,
~ ? [X0,X1,X2] :
( sum(X0,X1,X2)
<=> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f450,plain,
! [X0,X1,X2] :
( sum(X0,X1,X2)
<~> ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) ),
inference(ennf_transformation,[],[f403]) ).
fof(f453,plain,
! [X0,X1,X2] :
( ( ~ sum(X1,X2,X0)
| difference(X0,X1,X2) )
& ( ~ difference(X0,X1,X2)
| sum(X1,X2,X0) ) ),
inference(nnf_transformation,[],[f296]) ).
fof(f454,plain,
! [X0,X1,X2] :
( ( sum(X0,X1,X2)
| ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) )
& ( ~ sum(X0,X1,X2)
| ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f450]) ).
fof(f455,plain,
! [X0,X1,X2] :
( ( sum(X0,X1,X2)
| ( difference(X2,X0,X1)
& difference(X2,X1,X0) ) )
& ( ~ sum(X0,X1,X2)
| ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0) ) ),
inference(flattening,[],[f454]) ).
fof(f753,plain,
! [X2,X0,X1] :
( ~ sum(X1,X2,X0)
| difference(X0,X1,X2) ),
inference(cnf_transformation,[],[f453]) ).
fof(f754,plain,
! [X2,X0,X1] :
( ~ difference(X0,X1,X2)
| sum(X1,X2,X0) ),
inference(cnf_transformation,[],[f453]) ).
fof(f860,plain,
! [X2,X0,X1] :
( sum(X0,X1,X2)
| difference(X2,X0,X1) ),
inference(cnf_transformation,[],[f455]) ).
fof(f862,plain,
! [X2,X0,X1] :
( ~ sum(X0,X1,X2)
| ~ difference(X2,X0,X1)
| ~ difference(X2,X1,X0) ),
inference(cnf_transformation,[],[f455]) ).
tcf(c_346,plain,
! [X0: $i,X1: $i,X2: $i] :
( sum(X1,X2,X0)
| ~ difference(X0,X1,X2) ),
inference(cnf_transformation,[],[f754]) ).
tcf(c_347,plain,
! [X0: $i,X1: $i,X2: $i] :
( difference(X2,X0,X1)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f753]) ).
tcf(c_453,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ difference(X2,X1,X0)
| ~ difference(X2,X0,X1)
| ~ sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f862]) ).
tcf(c_455,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( difference(X2,X0,X1)
| sum(X0,X1,X2) ),
inference(cnf_transformation,[],[f860]) ).
tcf(c_458,plain,
( difference(n1,n1,n1)
| sum(n1,n1,n1) ),
inference(instantiation,[status(thm)],[c_455]) ).
tcf(c_460,plain,
( difference(n1,n1,n1)
| ~ sum(n1,n1,n1) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_461,plain,
( sum(n1,n1,n1)
| ~ difference(n1,n1,n1) ),
inference(instantiation,[status(thm)],[c_346]) ).
tcf(c_468,plain,
( ~ difference(n1,n1,n1)
| ~ sum(n1,n1,n1) ),
inference(instantiation,[status(thm)],[c_453]) ).
tcf(c_480,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_468,c_461,c_460,c_458]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM341+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.35 % Computer : n013.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 03:38:36 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 1.69/1.27 % SZS status Started for theBenchmark.p
% 1.69/1.27 % SZS status Theorem for theBenchmark.p
% 1.69/1.27
% 1.69/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/1.27
% 1.69/1.27 % ------ iProver source info
% 1.69/1.27
% 1.69/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.69/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/1.27 % git: non_committed_changes: false
% 1.69/1.27
% 1.69/1.27 % ------ Parsing...
% 1.69/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.69/1.27
% 1.69/1.27 % ------ Preprocessing...%
% 1.69/1.27
% 1.69/1.27 % SZS status Theorem for theBenchmark.p
% 1.69/1.27
% 1.69/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.27
% 1.69/1.27
%------------------------------------------------------------------------------