%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ROB010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:39:42 PM UTC 2026
% Result : Unsatisfiable 2.20s 1.30s
% Output : CNFRefutation 2.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 15 unt; 0 def)
% Number of atoms : 15 ( 14 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
fof(f2,axiom,
! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
fof(f3,axiom,
! [X0,X1] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
fof(f4,axiom,
negate(add(a,negate(b))) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
fof(f5,negated_conjecture,
negate(add(c,negate(add(b,a)))) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_result) ).
fof(f6,plain,
a != negate(add(c,negate(add(b,a)))),
inference(reorient_equations,[],[f5]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
negate(add(a,negate(b))) = c,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
negate(add(c,negate(add(b,a)))) != a,
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
negate(add(c,negate(add(a,b)))) != a,
inference(theory_normalisation,[status(thm)],[c_58,c_55,c_54]) ).
tcf(c_121,plain,
negate(add(negate(add(a,b)),c)) = a,
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_131,plain,
negate(add(c,negate(add(a,b)))) = a,
inference(theory_normalisation,[status(thm)],[c_121,c_55,c_54]) ).
tcf(c_132,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_131,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 08:29:26 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running UEQ theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 2.20/1.30 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.20/1.30 % SZS status Started for theBenchmark.p
% 2.20/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.20/1.30
% 2.20/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.20/1.30
% 2.20/1.30 % ------ iProver source info
% 2.20/1.30
% 2.20/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.20/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.20/1.30 % git: non_committed_changes: false
% 2.20/1.30
% 2.20/1.30 % ------ Parsing...% successful
% 2.20/1.30
% 2.20/1.30
% 2.20/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.20/1.30
% 2.20/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.20/1.30
% 2.20/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.20/1.30
% 2.20/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.20/1.30 % ------ Proving...
% 2.20/1.30 % ------ Problem Properties
% 2.20/1.30
% 2.20/1.30 %
% 2.20/1.30 % clauses 5
% 2.20/1.30 % conjectures 1
% 2.20/1.30 % EPR 0
% 2.20/1.30 % Horn 5
% 2.20/1.30 % unary 5
% 2.20/1.30 % binary 0
% 2.20/1.30 % lits 5
% 2.20/1.30 % lits eq 5
% 2.20/1.30 % fd_pure 0
% 2.20/1.30 % fd_pseudo 0
% 2.20/1.30 % fd_cond 0
% 2.20/1.30 % fd_pseudo_cond 0
% 2.20/1.30 % AC symbols 1
% 2.20/1.30
% 2.20/1.30 % ------ Input Options Time Limit: Unbounded
% 2.20/1.30
% 2.20/1.30
% 2.20/1.30 % ------
% 2.20/1.30 % Current options:
% 2.20/1.30 % ------
% 2.20/1.30
% 2.20/1.30
% 2.20/1.30 %
% 2.20/1.30
% 2.20/1.30 % ------ Proving...
% 2.20/1.30 %
% 2.20/1.30
% 2.20/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.20/1.30
% 2.20/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.20/1.30
% 2.20/1.30
%------------------------------------------------------------------------------