%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP679-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:10 PM UTC 2026
% Result : Unsatisfiable 1.63s 6.40s
% Output : CNFRefutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X0,X2))) = mult(mult(X0,mult(X1,X0)),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
fof(f8,axiom,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
fof(f9,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X0)),X2) = mult(X0,mult(X1,mult(X0,X2))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_175,plain,
! [X0: $i] : ld(op_c,mult(X0,op_c)) = X0,
inference(superposition,[status(thm)],[c_65,c_59]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i] : mult(X0,mult(unit,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c_63,c_64]) ).
tcf(c_258,plain,
! [X0: $i,X1: $i] : ld(op_c,mult(X0,mult(X1,mult(X0,op_c)))) = mult(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_64,c_175]) ).
tcf(c_280,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_185,c_63]) ).
tcf(c_281,plain,
mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
inference(demodulation,[status(thm)],[c_66,c_280]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i] : rd(mult(X0,mult(X0,X1)),X1) = mult(X0,X0),
inference(superposition,[status(thm)],[c_280,c_61]) ).
tcf(c_459,plain,
! [X0: $i] : rd(mult(op_c,mult(X0,op_c)),X0) = mult(op_c,op_c),
inference(superposition,[status(thm)],[c_65,c_290]) ).
tcf(c_1046,plain,
! [X0: $i] : mult(mult(op_c,op_c),X0) = mult(op_c,mult(X0,op_c)),
inference(superposition,[status(thm)],[c_459,c_60]) ).
tcf(c_1682,plain,
! [X0: $i] : mult(op_c,mult(X0,op_c)) = mult(op_c,mult(op_c,X0)),
inference(demodulation,[status(thm)],[c_1046,c_280]) ).
tcf(c_4493,plain,
! [X0: $i] : mult(X0,mult(op_c,op_c)) = mult(op_c,mult(X0,op_c)),
inference(superposition,[status(thm)],[c_258,c_59]) ).
tcf(c_4509,plain,
mult(op_c,mult(op_c,a)) != mult(op_c,mult(a,op_c)),
inference(demodulation,[status(thm)],[c_281,c_4493]) ).
tcf(c_4510,plain,
$false,
inference(ground_joinability,[status(thm)],[c_4509,c_1682]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP679-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.59 % Computer : n007.cluster.edu
% 0.11/5.59 % Model : x86_64 x86_64
% 0.11/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59 % Memory : 8046.5625MB
% 0.11/5.59 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Wed Sep 23 15:38:43 UTC 2026
% 0.11/5.59 % CPUTime :
% 0.11/5.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.62 Running UEQ theorem proving
% 0.14/5.62 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.14/5.64
% 0.14/5.64 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.64
% 0.14/5.64 % Detected problem language: tptp
% 0.14/5.65 % Proving...
% 1.63/6.40 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.63/6.40 % SZS status Started for theBenchmark.p
% 1.63/6.40 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/6.40
% 1.63/6.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.63/6.40
% 1.63/6.40 % ------ iProver source info
% 1.63/6.40
% 1.63/6.40 % git: date: 2026-07-19 20:42:38 +0200
% 1.63/6.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.63/6.40 % git: non_committed_changes: false
% 1.63/6.40
% 1.63/6.40 % ------ Parsing...% successful
% 1.63/6.40
% 1.63/6.40
% 1.63/6.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.63/6.40
% 1.63/6.40 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.63/6.40
% 1.63/6.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.63/6.40
% 1.63/6.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.63/6.40 % ------ Proving...
% 1.63/6.40 % ------ Problem Properties
% 1.63/6.40
% 1.63/6.40 %
% 1.63/6.40 % clauses 9
% 1.63/6.40 % conjectures 1
% 1.63/6.40 % EPR 0
% 1.63/6.40 % Horn 9
% 1.63/6.40 % unary 9
% 1.63/6.40 % binary 0
% 1.63/6.40 % lits 9
% 1.63/6.40 % lits eq 9
% 1.63/6.40 % fd_pure 0
% 1.63/6.40 % fd_pseudo 0
% 1.63/6.40 % fd_cond 0
% 1.63/6.40 % fd_pseudo_cond 0
% 1.63/6.40 % AC symbols 0
% 1.63/6.40
% 1.63/6.40 % ------ Input Options Time Limit: Unbounded
% 1.63/6.40
% 1.63/6.40
% 1.63/6.40 % ------
% 1.63/6.40 % Current options:
% 1.63/6.40 % ------
% 1.63/6.40
% 1.63/6.40
% 1.63/6.40 %
% 1.63/6.40
% 1.63/6.40 % ------ Proving...
% 1.63/6.40 %
% 1.63/6.40
% 1.63/6.40 % SZS status Unsatisfiable for theBenchmark.p
% 1.63/6.40
% 1.63/6.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.63/6.40
% 1.63/6.40
%------------------------------------------------------------------------------