%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP001-2 : 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 : n026.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:29:50 PM UTC 2026
% Result : Unsatisfiable 0.84s 11.19s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 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; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0] : multiply(X0,identity) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
fof(f8,axiom,
! [X0] : multiply(X0,X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',squareness) ).
fof(f9,plain,
! [X0] : identity = multiply(X0,X0),
inference(reorient_equations,[],[f8]) ).
fof(f10,axiom,
multiply(a,b) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_c) ).
fof(f11,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_times_a_is_c) ).
fof(f12,plain,
c != multiply(b,a),
inference(reorient_equations,[],[f11]) ).
tcf(c_57,plain,
! [X0: $i] : multiply(identity,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_60,plain,
! [X0: $i] : multiply(X0,identity) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_62,plain,
! [X0: $i] : multiply(X0,X0) = identity,
inference(cnf_transformation,[],[f9]) ).
tcf(c_63,plain,
multiply(a,b) = c,
inference(cnf_transformation,[],[f10]) ).
tcf(c_64,negated_conjecture,
multiply(b,a) != c,
inference(cnf_transformation,[],[f12]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_62,c_59]) ).
tcf(c_135,plain,
! [X0: $i] : multiply(a,multiply(b,X0)) = multiply(c,X0),
inference(superposition,[status(thm)],[c_63,c_59]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] : multiply(X0,multiply(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_134,c_57]) ).
tcf(c_156,plain,
multiply(a,c) = b,
inference(superposition,[status(thm)],[c_63,c_150]) ).
tcf(c_169,plain,
! [X0: $i] : multiply(a,multiply(c,X0)) = multiply(b,X0),
inference(superposition,[status(thm)],[c_156,c_59]) ).
tcf(c_173,plain,
multiply(a,identity) = multiply(c,b),
inference(superposition,[status(thm)],[c_62,c_135]) ).
tcf(c_182,plain,
multiply(c,b) = a,
inference(demodulation,[status(thm)],[c_173,c_60]) ).
tcf(c_183,plain,
multiply(c,a) = b,
inference(superposition,[status(thm)],[c_182,c_150]) ).
tcf(c_251,plain,
multiply(a,b) = multiply(b,a),
inference(superposition,[status(thm)],[c_183,c_169]) ).
tcf(c_254,plain,
multiply(b,a) = c,
inference(light_normalisation,[status(thm)],[c_251,c_63]) ).
tcf(c_255,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_254,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/10.39 % Computer : n026.cluster.edu
% 0.09/10.39 % Model : x86_64 x86_64
% 0.09/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.39 % Memory : 8046.5625MB
% 0.09/10.39 % OS : Linux 6.8.0-71-generic
% 0.09/10.39 % CPULimit : 300
% 0.09/10.39 % WCLimit : 300
% 0.09/10.39 % DateTime : Wed Sep 23 13:13:04 UTC 2026
% 0.09/10.39 % CPUTime :
% 0.09/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.42 Running UEQ theorem proving
% 0.15/10.42 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.15/10.44
% 0.15/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.45 % Proving...
% 0.84/11.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.84/11.19 % SZS status Started for theBenchmark.p
% 0.84/11.19 % SZS status Unsatisfiable for theBenchmark.p
% 0.84/11.19
% 0.84/11.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.84/11.19
% 0.84/11.19 % ------ iProver source info
% 0.84/11.19
% 0.84/11.19 % git: date: 2026-07-19 20:42:38 +0200
% 0.84/11.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.84/11.19 % git: non_committed_changes: false
% 0.84/11.19
% 0.84/11.19 % ------ Parsing...% successful
% 0.84/11.19
% 0.84/11.19
% 0.84/11.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.84/11.19
% 0.84/11.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.84/11.19
% 0.84/11.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.84/11.19
% 0.84/11.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.84/11.19 % ------ Proving...
% 0.84/11.19 % ------ Problem Properties
% 0.84/11.19
% 0.84/11.19 %
% 0.84/11.19 % clauses 8
% 0.84/11.19 % conjectures 1
% 0.84/11.19 % EPR 0
% 0.84/11.19 % Horn 8
% 0.84/11.19 % unary 8
% 0.84/11.19 % binary 0
% 0.84/11.19 % lits 8
% 0.84/11.19 % lits eq 8
% 0.84/11.19 % fd_pure 0
% 0.84/11.19 % fd_pseudo 0
% 0.84/11.19 % fd_cond 0
% 0.84/11.19 % fd_pseudo_cond 0
% 0.84/11.19 % AC symbols 0
% 0.84/11.19
% 0.84/11.19 % ------ Input Options Time Limit: Unbounded
% 0.84/11.19
% 0.84/11.19
% 0.84/11.19 % ------
% 0.84/11.19 % Current options:
% 0.84/11.19 % ------
% 0.84/11.19
% 0.84/11.19
% 0.84/11.19 %
% 0.84/11.19
% 0.84/11.19 % ------ Proving...
% 0.84/11.19 %
% 0.84/11.19
% 0.84/11.19 % SZS status Unsatisfiable for theBenchmark.p
% 0.84/11.19
% 0.84/11.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.84/11.19
% 0.84/11.19
%------------------------------------------------------------------------------