%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP730-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:35:19 PM UTC 2026
% Result : Unsatisfiable 16.24s 2.91s
% Output : CNFRefutation 16.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn 52 !; 0 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
fof(f5,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
fof(f6,plain,
! [X0] : unit = mult(i(X0),X0),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0,X1] : i(mult(X0,X1)) = mult(i(X0),i(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
fof(f8,axiom,
! [X0,X1] : mult(i(X0),mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
fof(f12,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),X2) = mult(mult(X0,mult(X1,X2)),asoc(X0,X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
fof(f13,axiom,
! [X0,X1] : mult(X0,X1) = mult(mult(X1,X0),op_k(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c11) ).
fof(f23,axiom,
! [X2,X3,X0,X1,X4] : asoc(asoc(X0,X1,X2),X3,X4) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c21) ).
fof(f24,plain,
! [X2,X3,X0,X1,X4] : unit = asoc(asoc(X0,X1,X2),X3,X4),
inference(reorient_equations,[],[f23]) ).
fof(f27,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f28,plain,
unit != asoc(op_k(a,b),c,d),
inference(reorient_equations,[],[f27]) ).
tcf(c_72,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_75,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f6]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] : mult(i(X0),i(X1)) = i(mult(X0,X1)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X2)),asoc(X0,X1,X2)) = mult(mult(X0,X1),X2),
inference(cnf_transformation,[],[f12]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),op_k(X1,X0)) = mult(X1,X0),
inference(cnf_transformation,[],[f13]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : asoc(asoc(X0,X1,X2),X3,X4) = unit,
inference(cnf_transformation,[],[f24]) ).
tcf(c_91,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
inference(cnf_transformation,[],[f28]) ).
tcf(c_418,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X1)),mult(X1,X0)) = op_k(X1,X0),
inference(superposition,[status(thm)],[c_82,c_77]) ).
tcf(c_545,plain,
! [X0: $i,X1: $i] : mult(unit,asoc(i(mult(X0,X1)),X0,X1)) = mult(mult(i(mult(X0,X1)),X0),X1),
inference(superposition,[status(thm)],[c_75,c_81]) ).
tcf(c_11954,plain,
! [X0: $i,X1: $i] : mult(mult(i(mult(X0,X1)),X0),X1) = asoc(i(mult(X0,X1)),X0,X1),
inference(demodulation,[status(thm)],[c_545,c_72]) ).
tcf(c_11966,plain,
! [X0: $i,X1: $i] : mult(mult(i(X0),i(X1)),mult(X1,X0)) = asoc(i(X0),i(X1),mult(X1,X0)),
inference(superposition,[status(thm)],[c_77,c_11954]) ).
tcf(c_12068,plain,
! [X0: $i,X1: $i] : asoc(i(X0),i(X1),mult(X1,X0)) = op_k(X1,X0),
inference(light_normalisation,[status(thm)],[c_11966,c_76,c_418]) ).
tcf(c_13920,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : asoc(op_k(X0,X1),X2,X3) = unit,
inference(superposition,[status(thm)],[c_12068,c_89]) ).
tcf(c_13945,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_91,c_13920]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP730-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 15:50:07 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 16.24/2.91 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 16.24/2.91 % SZS status Started for theBenchmark.p
% 16.24/2.91 % SZS status Unsatisfiable for theBenchmark.p
% 16.24/2.91
% 16.24/2.91 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 16.24/2.91
% 16.24/2.91 % ------ iProver source info
% 16.24/2.91
% 16.24/2.91 % git: date: 2026-07-19 20:42:38 +0200
% 16.24/2.91 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 16.24/2.91 % git: non_committed_changes: false
% 16.24/2.91
% 16.24/2.91 % ------ Parsing...% successful
% 16.24/2.91
% 16.24/2.91
% 16.24/2.91 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 16.24/2.91
% 16.24/2.91 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 16.24/2.91
% 16.24/2.91 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 16.24/2.91
% 16.24/2.91 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 16.24/2.91 % ------ Proving...
% 16.24/2.91 % ------ Problem Properties
% 16.24/2.91
% 16.24/2.91 %
% 16.24/2.91 % clauses 20
% 16.24/2.91 % conjectures 1
% 16.24/2.91 % EPR 0
% 16.24/2.91 % Horn 20
% 16.24/2.91 % unary 20
% 16.24/2.91 % binary 0
% 16.24/2.91 % lits 20
% 16.24/2.91 % lits eq 20
% 16.24/2.91 % fd_pure 0
% 16.24/2.91 % fd_pseudo 0
% 16.24/2.91 % fd_cond 0
% 16.24/2.91 % fd_pseudo_cond 0
% 16.24/2.91 % AC symbols 0
% 16.24/2.91
% 16.24/2.91 % ------ Input Options Time Limit: Unbounded
% 16.24/2.91
% 16.24/2.91
% 16.24/2.91 % ------
% 16.24/2.91 % Current options:
% 16.24/2.91 % ------
% 16.24/2.91
% 16.24/2.91
% 16.24/2.91 %
% 16.24/2.91
% 16.24/2.91 % ------ Proving...
% 16.24/2.91 %
% 16.24/2.91
% 16.24/2.91 % SZS status Unsatisfiable for theBenchmark.p
% 16.24/2.91
% 16.24/2.91 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 16.24/2.91
% 16.24/2.91
%------------------------------------------------------------------------------