%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ROB004-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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:41 PM UTC 2026
% Result : Unsatisfiable 3.33s 1.35s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 55 ( 55 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 51 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
fof(f4,axiom,
negate(d) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negate_d_is_c) ).
fof(f5,axiom,
add(c,d) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_plus_d_is_d) ).
fof(f6,plain,
d = add(c,d),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
add(c,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_plus_c_is_c) ).
fof(f8,plain,
c = add(c,c),
inference(reorient_equations,[],[f7]) ).
fof(f9,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
fof(f10,plain,
b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
inference(reorient_equations,[],[f9]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_59,plain,
negate(d) = c,
inference(cnf_transformation,[],[f4]) ).
tcf(c_60,plain,
add(c,d) = d,
inference(cnf_transformation,[],[f6]) ).
tcf(c_61,plain,
add(c,c) = c,
inference(cnf_transformation,[],[f8]) ).
tcf(c_62,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
inference(cnf_transformation,[],[f10]) ).
tcf(c_66,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(theory_normalisation,[status(thm)],[c_62,c_57,c_56]) ).
tcf(c_126,plain,
! [X0: $i] : add(c,add(d,X0)) = add(d,X0),
inference(superposition,[status(thm)],[c_60,c_57]) ).
tcf(c_127,plain,
! [X0: $i] : add(c,add(c,X0)) = add(c,X0),
inference(superposition,[status(thm)],[c_61,c_57]) ).
tcf(c_130,plain,
! [X0: $i] : add(c,add(X0,d)) = add(X0,d),
inference(superposition,[status(thm)],[c_56,c_126]) ).
tcf(c_135,plain,
! [X0: $i] : add(c,add(X0,c)) = add(X0,c),
inference(superposition,[status(thm)],[c_56,c_127]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X1,negate(X0))))) = X1,
inference(superposition,[status(thm)],[c_56,c_58]) ).
tcf(c_167,plain,
! [X0: $i] : negate(add(negate(add(X0,d)),negate(add(X0,c)))) = X0,
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_173,plain,
! [X0: $i] : negate(add(negate(add(X0,c)),negate(add(X0,d)))) = X0,
inference(theory_normalisation,[status(thm)],[c_167,c_57,c_56]) ).
tcf(c_255,plain,
! [X0: $i] : negate(add(negate(add(c,X0)),negate(add(X0,d)))) = X0,
inference(superposition,[status(thm)],[c_56,c_173]) ).
tcf(c_308,plain,
! [X0: $i] : negate(add(negate(add(c,X0)),negate(add(add(c,X0),d)))) = add(c,X0),
inference(superposition,[status(thm)],[c_127,c_255]) ).
tcf(c_310,plain,
! [X0: $i] : negate(add(negate(add(X0,c)),negate(add(add(X0,c),d)))) = add(X0,c),
inference(superposition,[status(thm)],[c_135,c_255]) ).
tcf(c_322,plain,
! [X0: $i] : negate(add(negate(add(X0,c)),negate(add(X0,add(c,d))))) = add(X0,c),
inference(theory_normalisation,[status(thm)],[c_310,c_57,c_56]) ).
tcf(c_323,plain,
! [X0: $i] : add(X0,c) = X0,
inference(light_normalisation,[status(thm)],[c_322,c_60,c_173]) ).
tcf(c_325,plain,
! [X0: $i] : negate(add(negate(add(c,X0)),negate(add(c,add(X0,d))))) = add(c,X0),
inference(theory_normalisation,[status(thm)],[c_308,c_57,c_56]) ).
tcf(c_326,plain,
! [X0: $i] : add(c,X0) = X0,
inference(light_normalisation,[status(thm)],[c_325,c_130,c_255]) ).
tcf(c_364,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(X0,negate(c))))) = X0,
inference(superposition,[status(thm)],[c_323,c_58]) ).
tcf(c_389,plain,
! [X0: $i] : negate(add(negate(add(c,X0)),negate(negate(X0)))) = c,
inference(superposition,[status(thm)],[c_326,c_58]) ).
tcf(c_392,plain,
! [X0: $i] : negate(add(negate(negate(X0)),negate(add(c,X0)))) = c,
inference(theory_normalisation,[status(thm)],[c_389,c_57,c_56]) ).
tcf(c_393,plain,
! [X0: $i] : negate(add(negate(negate(X0)),negate(X0))) = c,
inference(light_normalisation,[status(thm)],[c_392,c_326]) ).
tcf(c_394,plain,
! [X0: $i] : negate(add(negate(X0),negate(negate(X0)))) = c,
inference(theory_normalisation,[status(thm)],[c_393,c_57,c_56]) ).
tcf(c_422,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(negate(c),X0)))) = X0,
inference(superposition,[status(thm)],[c_56,c_364]) ).
tcf(c_548,plain,
! [X0: $i] : negate(add(X0,negate(X0))) = c,
inference(superposition,[status(thm)],[c_422,c_394]) ).
tcf(c_569,plain,
! [X0: $i] : negate(add(c,negate(add(X0,negate(negate(X0)))))) = X0,
inference(superposition,[status(thm)],[c_548,c_58]) ).
tcf(c_571,plain,
! [X0: $i] : negate(add(negate(add(X0,X0)),c)) = X0,
inference(superposition,[status(thm)],[c_548,c_58]) ).
tcf(c_578,plain,
! [X0: $i] : negate(add(c,negate(add(X0,X0)))) = X0,
inference(theory_normalisation,[status(thm)],[c_571,c_57,c_56]) ).
tcf(c_613,plain,
! [X0: $i] : negate(negate(add(X0,X0))) = X0,
inference(demodulation,[status(thm)],[c_578,c_326]) ).
tcf(c_621,plain,
! [X0: $i] : negate(add(negate(add(X0,X0)),X0)) = c,
inference(superposition,[status(thm)],[c_613,c_548]) ).
tcf(c_624,plain,
! [X0: $i] : negate(add(X0,negate(add(X0,X0)))) = c,
inference(theory_normalisation,[status(thm)],[c_621,c_57,c_56]) ).
tcf(c_645,plain,
! [X0: $i] : negate(add(negate(add(X0,add(X0,X0))),c)) = X0,
inference(superposition,[status(thm)],[c_624,c_58]) ).
tcf(c_651,plain,
! [X0: $i] : negate(add(c,negate(add(X0,add(X0,X0))))) = X0,
inference(theory_normalisation,[status(thm)],[c_645,c_57,c_56]) ).
tcf(c_954,plain,
! [X0: $i] : negate(negate(add(X0,negate(negate(X0))))) = X0,
inference(demodulation,[status(thm)],[c_569,c_326]) ).
tcf(c_957,plain,
! [X0: $i] : negate(negate(add(add(X0,X0),X0))) = add(X0,X0),
inference(superposition,[status(thm)],[c_613,c_954]) ).
tcf(c_978,plain,
! [X0: $i] : negate(negate(add(X0,add(X0,X0)))) = add(X0,X0),
inference(theory_normalisation,[status(thm)],[c_957,c_57,c_56]) ).
tcf(c_1066,plain,
! [X0: $i] : add(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_651,c_326,c_978]) ).
tcf(c_1068,plain,
! [X0: $i] : negate(negate(X0)) = X0,
inference(demodulation,[status(thm)],[c_613,c_1066]) ).
tcf(c_1278,plain,
! [X0: $i,X1: $i] : add(negate(add(X0,X1)),negate(add(X1,negate(X0)))) = negate(X1),
inference(superposition,[status(thm)],[c_156,c_1068]) ).
tcf(c_1301,plain,
negate(negate(b)) != b,
inference(demodulation,[status(thm)],[c_66,c_1278]) ).
tcf(c_1303,plain,
$false,
inference(ground_joinability,[status(thm)],[c_1301,c_1068]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : ROB004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.20/0.46 % Computer : n003.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Thu Sep 24 08:25:35 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.24/0.52 Running UEQ theorem proving
% 0.24/0.52 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.54
% 0.24/0.54 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.54
% 0.24/0.54 % Detected problem language: tptp
% 0.24/0.56 % Proving...
% 3.33/1.35 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.33/1.35 % SZS status Started for theBenchmark.p
% 3.33/1.35 % SZS status Unsatisfiable for theBenchmark.p
% 3.33/1.35
% 3.33/1.35 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.33/1.35
% 3.33/1.35 % ------ iProver source info
% 3.33/1.35
% 3.33/1.35 % git: date: 2026-07-19 20:42:38 +0200
% 3.33/1.35 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.33/1.35 % git: non_committed_changes: false
% 3.33/1.35
% 3.33/1.35 % ------ Parsing...% successful
% 3.33/1.35
% 3.33/1.35
% 3.33/1.35 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.33/1.35
% 3.33/1.35 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.33/1.35
% 3.33/1.35 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.33/1.35
% 3.33/1.35 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.33/1.35 % ------ Proving...
% 3.33/1.35 % ------ Problem Properties
% 3.33/1.35
% 3.33/1.35 %
% 3.33/1.35 % clauses 7
% 3.33/1.35 % conjectures 1
% 3.33/1.35 % EPR 0
% 3.33/1.35 % Horn 7
% 3.33/1.35 % unary 7
% 3.33/1.35 % binary 0
% 3.33/1.35 % lits 7
% 3.33/1.35 % lits eq 7
% 3.33/1.35 % fd_pure 0
% 3.33/1.35 % fd_pseudo 0
% 3.33/1.35 % fd_cond 0
% 3.33/1.35 % fd_pseudo_cond 0
% 3.33/1.35 % AC symbols 1
% 3.33/1.35
% 3.33/1.35 % ------ Input Options Time Limit: Unbounded
% 3.33/1.35
% 3.33/1.35
% 3.33/1.35 % ------
% 3.33/1.35 % Current options:
% 3.33/1.35 % ------
% 3.33/1.35
% 3.33/1.35
% 3.33/1.35 %
% 3.33/1.35
% 3.33/1.35 % ------ Proving...
% 3.33/1.35 %
% 3.33/1.35
% 3.33/1.35 % SZS status Unsatisfiable for theBenchmark.p
% 3.33/1.35
% 3.33/1.35 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.33/1.35
% 3.33/1.35
%------------------------------------------------------------------------------