%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP680-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 : n013.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.80s 1.16s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn 47 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
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(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
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,X1] : mult(i(X0),mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
fof(f9,axiom,
! [X0] : mult(op_c,X0) = mult(X0,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
fof(f10,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,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_66,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,negated_conjecture,
mult(i(op_c),a) != mult(a,i(op_c)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_165,plain,
! [X0: $i] : ld(X0,X0) = unit,
inference(superposition,[status(thm)],[c_63,c_60]) ).
tcf(c_190,plain,
! [X0: $i] : rd(mult(X0,op_c),X0) = op_c,
inference(superposition,[status(thm)],[c_67,c_62]) ).
tcf(c_252,plain,
! [X0: $i,X1: $i] : rd(mult(X0,mult(X1,mult(X0,op_c))),mult(X0,mult(X1,X0))) = op_c,
inference(superposition,[status(thm)],[c_65,c_190]) ).
tcf(c_331,plain,
! [X0: $i,X1: $i] : mult(i(X0),X1) = ld(X0,X1),
inference(superposition,[status(thm)],[c_59,c_66]) ).
tcf(c_349,plain,
mult(a,i(op_c)) != ld(op_c,a),
inference(demodulation,[status(thm)],[c_68,c_331]) ).
tcf(c_380,plain,
! [X0: $i,X1: $i] : rd(mult(i(X0),mult(X1,ld(X0,op_c))),mult(i(X0),mult(X1,i(X0)))) = op_c,
inference(superposition,[status(thm)],[c_331,c_252]) ).
tcf(c_547,plain,
! [X0: $i,X1: $i] : rd(ld(X0,mult(X1,ld(X0,op_c))),ld(X0,mult(X1,i(X0)))) = op_c,
inference(demodulation,[status(thm)],[c_380,c_331]) ).
tcf(c_561,plain,
! [X0: $i,X1: $i] : rd(ld(X0,mult(rd(X1,i(X0)),ld(X0,op_c))),ld(X0,X1)) = op_c,
inference(superposition,[status(thm)],[c_61,c_547]) ).
tcf(c_1151,plain,
! [X0: $i,X1: $i] : ld(X0,mult(rd(X1,i(X0)),ld(X0,op_c))) = mult(op_c,ld(X0,X1)),
inference(superposition,[status(thm)],[c_561,c_61]) ).
tcf(c_1593,plain,
! [X0: $i] : ld(op_c,mult(rd(X0,i(op_c)),unit)) = mult(op_c,ld(op_c,X0)),
inference(superposition,[status(thm)],[c_165,c_1151]) ).
tcf(c_1636,plain,
! [X0: $i] : ld(op_c,rd(X0,i(op_c))) = X0,
inference(demodulation,[status(thm)],[c_1593,c_59,c_63]) ).
tcf(c_1637,plain,
! [X0: $i] : mult(X0,i(op_c)) = ld(op_c,X0),
inference(superposition,[status(thm)],[c_62,c_1636]) ).
tcf(c_1649,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_349,c_1637]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP680-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.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 15:40:36 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running UEQ theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 1.80/1.16 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.80/1.16 % SZS status Started for theBenchmark.p
% 1.80/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.80/1.16
% 1.80/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.16
% 1.80/1.16 % ------ iProver source info
% 1.80/1.16
% 1.80/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.16 % git: non_committed_changes: false
% 1.80/1.16
% 1.80/1.16 % ------ Parsing...% successful
% 1.80/1.16
% 1.80/1.16
% 1.80/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/1.16
% 1.80/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.80/1.16
% 1.80/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/1.16
% 1.80/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.80/1.16 % ------ Proving...
% 1.80/1.16 % ------ Problem Properties
% 1.80/1.16
% 1.80/1.16 %
% 1.80/1.16 % clauses 10
% 1.80/1.16 % conjectures 1
% 1.80/1.16 % EPR 0
% 1.80/1.16 % Horn 10
% 1.80/1.16 % unary 10
% 1.80/1.16 % binary 0
% 1.80/1.16 % lits 10
% 1.80/1.16 % lits eq 10
% 1.80/1.16 % fd_pure 0
% 1.80/1.16 % fd_pseudo 0
% 1.80/1.16 % fd_cond 0
% 1.80/1.16 % fd_pseudo_cond 0
% 1.80/1.16 % AC symbols 0
% 1.80/1.16
% 1.80/1.16 % ------ Input Options Time Limit: Unbounded
% 1.80/1.16
% 1.80/1.16
% 1.80/1.16 % ------
% 1.80/1.16 % Current options:
% 1.80/1.16 % ------
% 1.80/1.16
% 1.80/1.16
% 1.80/1.16 %
% 1.80/1.16
% 1.80/1.16 % ------ Proving...
% 1.80/1.16 %
% 1.80/1.16
% 1.80/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 1.80/1.16
% 1.80/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.16
% 1.80/1.16
%------------------------------------------------------------------------------