%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : BOO072-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n020.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 01:00:20 PM UTC 2026
% Result : Unsatisfiable 7.93s 1.75s
% Output : CNFRefutation 7.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 13 ( 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 : 66 ( 0 sgn 66 !; 0 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : inverse(add(inverse(add(inverse(add(X0,X1)),X2)),inverse(add(X0,inverse(add(inverse(X2),inverse(add(X2,X3)))))))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dn1) ).
fof(f2,negated_conjecture,
add(b,a) != add(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',huntinton_1) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(add(inverse(add(inverse(add(X0,X1)),X2)),inverse(add(X0,inverse(add(inverse(X2),inverse(add(X2,X3)))))))) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_52,negated_conjecture,
add(b,a) != add(a,b),
inference(cnf_transformation,[],[f2]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X0)),X1)),X0)),X2)),inverse(X0))),X0)) = inverse(X0),
inference(superposition,[status(thm)],[c_51,c_51]) ).
tcf(c_106,plain,
! [X0: $i] : inverse(add(inverse(add(X0,inverse(X0))),X0)) = inverse(X0),
inference(superposition,[status(thm)],[c_51,c_100]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] : inverse(add(inverse(X0),inverse(add(X0,inverse(add(inverse(X0),inverse(add(X0,X1)))))))) = X0,
inference(superposition,[status(thm)],[c_106,c_51]) ).
tcf(c_179,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(add(inverse(add(X0,X1)),inverse(add(inverse(X0),inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
inference(superposition,[status(thm)],[c_139,c_51]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(add(inverse(add(inverse(add(X0,X1)),X2)),inverse(add(X0,X2)))) = X2,
inference(superposition,[status(thm)],[c_139,c_51]) ).
tcf(c_189,plain,
! [X0: $i] : inverse(add(inverse(X0),inverse(add(X0,X0)))) = X0,
inference(superposition,[status(thm)],[c_139,c_139]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i] : inverse(add(inverse(add(X0,X1)),inverse(add(inverse(X0),X1)))) = X1,
inference(superposition,[status(thm)],[c_139,c_183]) ).
tcf(c_331,plain,
! [X0: $i] : inverse(add(inverse(add(add(X0,inverse(X0)),X0)),inverse(X0))) = X0,
inference(superposition,[status(thm)],[c_106,c_253]) ).
tcf(c_333,plain,
! [X0: $i] : inverse(add(inverse(add(X0,inverse(add(X0,X0)))),X0)) = inverse(add(X0,X0)),
inference(superposition,[status(thm)],[c_189,c_253]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(add(inverse(add(X0,X1)),inverse(add(inverse(add(X2,X0)),X1)))) = X1,
inference(superposition,[status(thm)],[c_253,c_183]) ).
tcf(c_414,plain,
! [X0: $i] : inverse(add(X0,inverse(add(add(X0,inverse(X0)),inverse(X0))))) = inverse(X0),
inference(superposition,[status(thm)],[c_331,c_183]) ).
tcf(c_527,plain,
! [X0: $i,X1: $i] : inverse(add(inverse(add(inverse(X0),X1)),inverse(add(X0,X1)))) = X1,
inference(superposition,[status(thm)],[c_414,c_183]) ).
tcf(c_875,plain,
! [X0: $i] : inverse(add(inverse(add(X0,X0)),inverse(add(X0,X0)))) = X0,
inference(superposition,[status(thm)],[c_333,c_183]) ).
tcf(c_1054,plain,
! [X0: $i] : inverse(add(inverse(add(inverse(X0),X0)),inverse(X0))) = X0,
inference(superposition,[status(thm)],[c_100,c_344]) ).
tcf(c_1191,plain,
! [X0: $i] : inverse(add(X0,inverse(add(inverse(X0),inverse(X0))))) = inverse(X0),
inference(superposition,[status(thm)],[c_1054,c_183]) ).
tcf(c_1286,plain,
! [X0: $i] : inverse(add(inverse(X0),inverse(X0))) = X0,
inference(superposition,[status(thm)],[c_1191,c_139]) ).
tcf(c_1313,plain,
! [X0: $i] : add(X0,X0) = X0,
inference(demodulation,[status(thm)],[c_875,c_1286]) ).
tcf(c_1393,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_1286,c_1313]) ).
tcf(c_1400,plain,
! [X0: $i,X1: $i,X2: $i] : add(inverse(add(inverse(add(X0,X1)),X2)),inverse(add(X0,X2))) = inverse(X2),
inference(superposition,[status(thm)],[c_183,c_1393]) ).
tcf(c_1405,plain,
! [X0: $i,X1: $i] : add(inverse(add(inverse(X0),X1)),inverse(add(X0,X1))) = inverse(X1),
inference(superposition,[status(thm)],[c_527,c_1393]) ).
tcf(c_2138,plain,
! [X0: $i,X1: $i] : add(inverse(inverse(X0)),inverse(add(inverse(X1),inverse(add(X1,X0))))) = inverse(inverse(add(X1,X0))),
inference(superposition,[status(thm)],[c_1405,c_1400]) ).
tcf(c_2192,plain,
! [X0: $i,X1: $i,X2: $i] : add(inverse(inverse(X0)),inverse(add(inverse(add(X1,X2)),inverse(add(X1,X0))))) = inverse(inverse(add(X1,X0))),
inference(superposition,[status(thm)],[c_1400,c_1400]) ).
tcf(c_2206,plain,
! [X0: $i,X1: $i] : add(X0,inverse(add(inverse(X1),inverse(add(X1,X0))))) = inverse(inverse(add(X1,X0))),
inference(light_normalisation,[status(thm)],[c_2138,c_1393]) ).
tcf(c_2208,plain,
! [X0: $i,X1: $i,X2: $i] : add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(X1,X0))))) = inverse(inverse(add(X1,X0))),
inference(light_normalisation,[status(thm)],[c_2192,c_1393]) ).
tcf(c_3801,plain,
! [X0: $i,X1: $i] : add(X0,inverse(add(inverse(X1),inverse(add(X1,X0))))) = add(X1,X0),
inference(demodulation,[status(thm)],[c_2206,c_1393]) ).
tcf(c_5409,plain,
! [X0: $i,X1: $i,X2: $i] : add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(X1,X0))))) = add(X1,X0),
inference(demodulation,[status(thm)],[c_2208,c_1393]) ).
tcf(c_5487,plain,
! [X0: $i,X1: $i,X2: $i] : add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(X2,X0))))) = add(X2,X0),
inference(superposition,[status(thm)],[c_5409,c_5409]) ).
tcf(c_8646,plain,
! [X0: $i,X1: $i] : inverse(add(inverse(add(X0,X1)),inverse(add(X1,inverse(X0))))) = X1,
inference(superposition,[status(thm)],[c_3801,c_179]) ).
tcf(c_9564,plain,
! [X0: $i,X1: $i] : add(inverse(X0),X1) = add(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_8646,c_5487]) ).
tcf(c_9835,plain,
! [X0: $i,X1: $i] : add(X0,X1) = add(X1,X0),
inference(superposition,[status(thm)],[c_1393,c_9564]) ).
tcf(c_9885,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_9835]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO072-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/0.36 % Computer : n020.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Fri Sep 25 06:43:18 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running UEQ theorem proving
% 0.14/0.39 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 7.93/1.75 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 7.93/1.75 % SZS status Started for theBenchmark.p
% 7.93/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 7.93/1.75
% 7.93/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.93/1.75
% 7.93/1.75 % ------ iProver source info
% 7.93/1.75
% 7.93/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 7.93/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.93/1.75 % git: non_committed_changes: false
% 7.93/1.75
% 7.93/1.75 % ------ Parsing...% successful
% 7.93/1.75
% 7.93/1.75
% 7.93/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.93/1.75
% 7.93/1.75 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.93/1.75
% 7.93/1.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.93/1.75
% 7.93/1.75 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.93/1.75 % ------ Proving...
% 7.93/1.75 % ------ Problem Properties
% 7.93/1.75
% 7.93/1.75 %
% 7.93/1.75 % clauses 2
% 7.93/1.75 % conjectures 1
% 7.93/1.75 % EPR 0
% 7.93/1.75 % Horn 2
% 7.93/1.75 % unary 2
% 7.93/1.75 % binary 0
% 7.93/1.75 % lits 2
% 7.93/1.75 % lits eq 2
% 7.93/1.75 % fd_pure 0
% 7.93/1.75 % fd_pseudo 0
% 7.93/1.75 % fd_cond 0
% 7.93/1.75 % fd_pseudo_cond 0
% 7.93/1.75 % AC symbols 0
% 7.93/1.75
% 7.93/1.75 % ------ Input Options Time Limit: Unbounded
% 7.93/1.75
% 7.93/1.75
% 7.93/1.75 % ------
% 7.93/1.75 % Current options:
% 7.93/1.75 % ------
% 7.93/1.75
% 7.93/1.75
% 7.93/1.75 %
% 7.93/1.75
% 7.93/1.75 % ------ Proving...
% 7.93/1.75 %
% 7.93/1.75
% 7.93/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 7.93/1.75
% 7.93/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.93/1.75
% 7.93/1.75
%------------------------------------------------------------------------------