%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ROB023-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 : n012.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:44 PM UTC 2026
% Result : Unsatisfiable 2.44s 1.18s
% Output : CNFRefutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 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 : 9 ( 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 38 :)
% 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,
! [X0] : add(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_plus_x_is_x) ).
fof(f5,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(f6,plain,
b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
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,
! [X0: $i] : add(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
inference(cnf_transformation,[],[f6]) ).
tcf(c_63,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(theory_normalisation,[status(thm)],[c_58,c_55,c_54]) ).
tcf(c_148,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(X0,negate(X0))))) = X0,
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(X1,negate(X0))))) = X1,
inference(superposition,[status(thm)],[c_54,c_56]) ).
tcf(c_156,plain,
! [X0: $i] : negate(add(negate(add(negate(X0),X0)),negate(negate(X0)))) = negate(X0),
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_164,plain,
! [X0: $i] : negate(add(negate(negate(X0)),negate(add(X0,negate(X0))))) = negate(X0),
inference(theory_normalisation,[status(thm)],[c_156,c_55,c_54]) ).
tcf(c_188,plain,
! [X0: $i] : negate(add(negate(add(negate(X0),add(X0,negate(X0)))),X0)) = negate(X0),
inference(superposition,[status(thm)],[c_148,c_56]) ).
tcf(c_190,plain,
! [X0: $i] : negate(add(X0,negate(add(X0,add(negate(X0),negate(X0)))))) = negate(X0),
inference(theory_normalisation,[status(thm)],[c_188,c_55,c_54]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(negate(X0),X1)))) = X1,
inference(superposition,[status(thm)],[c_54,c_149]) ).
tcf(c_292,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(add(negate(X0),negate(add(X0,negate(X0)))),X0)))) = X0,
inference(superposition,[status(thm)],[c_148,c_164]) ).
tcf(c_305,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(X0,add(negate(X0),negate(add(X0,negate(X0)))))))) = X0,
inference(theory_normalisation,[status(thm)],[c_292,c_55,c_54]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(add(negate(X0),negate(add(X0,negate(X0)))),X1)),negate(add(X0,X1)))) = X1,
inference(superposition,[status(thm)],[c_148,c_226]) ).
tcf(c_408,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(negate(X0),add(negate(add(X0,negate(X0))),X1))))) = X1,
inference(theory_normalisation,[status(thm)],[c_385,c_55,c_54]) ).
tcf(c_503,plain,
! [X0: $i] : negate(add(X0,negate(add(X0,negate(X0))))) = negate(X0),
inference(demodulation,[status(thm)],[c_190,c_57]) ).
tcf(c_521,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(add(X0,negate(add(X0,negate(X0)))),negate(X0))))) = add(X0,negate(add(X0,negate(X0)))),
inference(superposition,[status(thm)],[c_503,c_148]) ).
tcf(c_535,plain,
! [X0: $i] : negate(add(negate(X0),negate(add(X0,add(negate(X0),negate(add(X0,negate(X0)))))))) = add(X0,negate(add(X0,negate(X0)))),
inference(theory_normalisation,[status(thm)],[c_521,c_55,c_54]) ).
tcf(c_536,plain,
! [X0: $i] : add(X0,negate(add(X0,negate(X0)))) = X0,
inference(light_normalisation,[status(thm)],[c_535,c_305]) ).
tcf(c_594,plain,
! [X0: $i,X1: $i] : add(X0,add(negate(add(X0,negate(X0))),X1)) = add(X0,X1),
inference(superposition,[status(thm)],[c_536,c_55]) ).
tcf(c_672,plain,
! [X0: $i,X1: $i] : negate(add(negate(add(X0,X1)),negate(add(negate(X0),add(negate(add(X0,negate(X0))),X1))))) = add(negate(add(X0,negate(X0))),X1),
inference(superposition,[status(thm)],[c_594,c_226]) ).
tcf(c_688,plain,
! [X0: $i,X1: $i] : add(negate(add(X0,negate(X0))),X1) = X1,
inference(light_normalisation,[status(thm)],[c_672,c_408]) ).
tcf(c_808,plain,
! [X0: $i,X1: $i] : add(X0,negate(add(X1,negate(X1)))) = X0,
inference(superposition,[status(thm)],[c_688,c_54]) ).
tcf(c_835,plain,
! [X0: $i] : negate(negate(X0)) = X0,
inference(demodulation,[status(thm)],[c_148,c_808]) ).
tcf(c_890,plain,
! [X0: $i,X1: $i] : add(negate(add(X0,X1)),negate(add(X1,negate(X0)))) = negate(X1),
inference(superposition,[status(thm)],[c_149,c_835]) ).
tcf(c_902,plain,
negate(negate(b)) != b,
inference(demodulation,[status(thm)],[c_63,c_890]) ).
tcf(c_903,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_902,c_835]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ROB023-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.51 % Computer : n012.cluster.edu
% 0.03/0.51 % Model : x86_64 x86_64
% 0.03/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.51 % Memory : 8046.5625MB
% 0.03/0.51 % OS : Linux 6.8.0-71-generic
% 0.03/0.51 % CPULimit : 300
% 0.03/0.51 % WCLimit : 300
% 0.03/0.51 % DateTime : Thu Sep 24 08:28:19 UTC 2026
% 0.03/0.51 % CPUTime :
% 0.03/0.52 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.53 Running UEQ theorem proving
% 0.07/0.53 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.07/0.54
% 0.07/0.54 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.54
% 0.07/0.54 % Detected problem language: tptp
% 0.07/0.55 % Proving...
% 2.44/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.44/1.18 % SZS status Started for theBenchmark.p
% 2.44/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.44/1.18
% 2.44/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.44/1.18
% 2.44/1.18 % ------ iProver source info
% 2.44/1.18
% 2.44/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.44/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.44/1.18 % git: non_committed_changes: false
% 2.44/1.18
% 2.44/1.18 % ------ Parsing...% successful
% 2.44/1.18
% 2.44/1.18
% 2.44/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.44/1.18
% 2.44/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.44/1.18
% 2.44/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.44/1.18
% 2.44/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.44/1.18 % ------ Proving...
% 2.44/1.18 % ------ Problem Properties
% 2.44/1.18
% 2.44/1.18 %
% 2.44/1.18 % clauses 5
% 2.44/1.18 % conjectures 1
% 2.44/1.18 % EPR 0
% 2.44/1.18 % Horn 5
% 2.44/1.18 % unary 5
% 2.44/1.18 % binary 0
% 2.44/1.18 % lits 5
% 2.44/1.18 % lits eq 5
% 2.44/1.18 % fd_pure 0
% 2.44/1.18 % fd_pseudo 0
% 2.44/1.18 % fd_cond 0
% 2.44/1.18 % fd_pseudo_cond 0
% 2.44/1.18 % AC symbols 1
% 2.44/1.18
% 2.44/1.18 % ------ Input Options Time Limit: Unbounded
% 2.44/1.18
% 2.44/1.18
% 2.44/1.18 % ------
% 2.44/1.18 % Current options:
% 2.44/1.18 % ------
% 2.44/1.18
% 2.44/1.18
% 2.44/1.18 %
% 2.44/1.18
% 2.44/1.18 % ------ Proving...
% 2.44/1.18 %
% 2.44/1.18
% 2.44/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.44/1.18
% 2.44/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.44/1.18
% 2.44/1.18
%------------------------------------------------------------------------------