%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ROB021-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 : n010.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.85s 1.27s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 24 unt; 7 def)
% Number of atoms : 58 ( 31 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 9 ( 7 usr; 8 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 10 :)
% 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,
! [X0,X1] :
( X0 = X1
| negate(X0) != negate(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',negative_equality_implies_positive_equality) ).
fof(f5,plain,
! [X0,X1] :
( X0 = X1
| negate(X1) != negate(X0) ),
inference(reorient_equations,[],[f4]) ).
fof(f6,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
fof(f7,plain,
b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
inference(reorient_equations,[],[f6]) ).
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,X1: $i] :
( ( X0 = X1 )
| ( negate(X0) != negate(X1) ) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_58,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
inference(cnf_transformation,[],[f7]) ).
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_82,definition,
iPr_def_10 = negate(b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_83,definition,
iPr_def_11 = add(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_84,definition,
iPr_def_12 = negate(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_85,definition,
iPr_def_13 = negate(a),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_86,definition,
iPr_def_14 = add(iPr_def_10,iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_87,definition,
iPr_def_15 = negate(iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_88,definition,
iPr_def_16 = add(iPr_def_12,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_89,negated_conjecture,
iPr_def_16 != b,
inference(demodulation,[status(thm)],[c_63,c_85,c_86,c_87,c_82,c_83,c_84,c_88]) ).
tcf(c_169,plain,
add(iPr_def_10,a) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_83,c_55,c_54]) ).
tcf(c_185,plain,
! [X0: $i] :
( ( X0 = b )
| ( negate(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_82,c_57]) ).
tcf(c_215,plain,
negate(add(negate(iPr_def_11),negate(add(iPr_def_10,negate(a))))) = iPr_def_10,
inference(superposition,[status(thm)],[c_169,c_56]) ).
tcf(c_230,plain,
negate(iPr_def_16) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_215,c_84,c_85,c_86,c_87,c_88]) ).
tcf(c_351,plain,
b = iPr_def_16,
inference(superposition,[status(thm)],[c_230,c_185]) ).
tcf(c_362,plain,
iPr_def_16 != iPr_def_16,
inference(demodulation,[status(thm)],[c_89,c_351]) ).
tcf(c_363,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_362]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB021-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.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 08:28:36 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 2.85/1.27 % SZS status Started for theBenchmark.p
% 2.85/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.85/1.27
% 2.85/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.85/1.27
% 2.85/1.27 % ------ iProver source info
% 2.85/1.27
% 2.85/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.85/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.85/1.27 % git: non_committed_changes: false
% 2.85/1.27
% 2.85/1.27 % ------ Parsing...% successful
% 2.85/1.27
% 2.85/1.27
% 2.85/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.85/1.27
% 2.85/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.85/1.27
% 2.85/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.85/1.27
% 2.85/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.85/1.27 % ------ Proving...
% 2.85/1.27 % ------ Problem Properties
% 2.85/1.27
% 2.85/1.27 %
% 2.85/1.27 % clauses 12
% 2.85/1.27 % conjectures 1
% 2.85/1.27 % EPR 1
% 2.85/1.27 % Horn 12
% 2.85/1.27 % unary 11
% 2.85/1.27 % binary 1
% 2.85/1.27 % lits 13
% 2.85/1.27 % lits eq 13
% 2.85/1.27 % fd_pure 0
% 2.85/1.27 % fd_pseudo 0
% 2.85/1.27 % fd_cond 0
% 2.85/1.27 % fd_pseudo_cond 1
% 2.85/1.27 % AC symbols 1
% 2.85/1.27
% 2.85/1.27 % ------ Schedule dynamic 5 is on
% 2.85/1.27
% 2.85/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.85/1.27
% 2.85/1.27
% 2.85/1.27 % ------
% 2.85/1.27 % Current options:
% 2.85/1.27 % ------
% 2.85/1.27
% 2.85/1.27
% 2.85/1.27 %
% 2.85/1.27
% 2.85/1.27 % ------ Proving...
% 2.85/1.27 %
% 2.85/1.27
% 2.85/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.85/1.27
% 2.85/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.85/1.27
% 2.85/1.27
%------------------------------------------------------------------------------