%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP703-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:15 PM UTC 2026
% Result : Unsatisfiable 2.40s 1.28s
% Output : CNFRefutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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; 6 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f9,axiom,
! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
fof(f11,axiom,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).
fof(f12,axiom,
! [X0,X1] : op_e = mult(mult(rd(op_c,mult(X0,X1)),X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f12) ).
fof(f14,negated_conjecture,
mult(x2,mult(x3,op_e)) != mult(mult(x2,x3),op_e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_67,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),op_c) = mult(X0,mult(X1,op_c)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_73,plain,
! [X0: $i] : ld(X0,mult(op_c,X0)) = op_d,
inference(cnf_transformation,[],[f11]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : mult(mult(rd(op_c,mult(X0,X1)),X1),X0) = op_e,
inference(cnf_transformation,[],[f12]) ).
tcf(c_76,negated_conjecture,
mult(mult(x2,x3),op_e) != mult(x2,mult(x3,op_e)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_210,plain,
! [X0: $i] : mult(X0,op_d) = mult(op_c,X0),
inference(superposition,[status(thm)],[c_73,c_63]) ).
tcf(c_211,plain,
op_c = op_d,
inference(superposition,[status(thm)],[c_73,c_64]) ).
tcf(c_261,plain,
! [X0: $i] : mult(X0,op_c) = mult(op_c,X0),
inference(light_normalisation,[status(thm)],[c_210,c_211]) ).
tcf(c_262,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,op_c)) = mult(op_c,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_71,c_261]) ).
tcf(c_368,plain,
! [X0: $i] : mult(rd(op_c,mult(unit,X0)),X0) = op_e,
inference(superposition,[status(thm)],[c_74,c_67]) ).
tcf(c_372,plain,
! [X0: $i] : mult(rd(op_c,X0),X0) = op_e,
inference(light_normalisation,[status(thm)],[c_368,c_68]) ).
tcf(c_623,plain,
op_c = op_e,
inference(demodulation,[status(thm)],[c_372,c_65]) ).
tcf(c_624,plain,
mult(mult(x2,x3),op_c) != mult(x2,mult(x3,op_c)),
inference(demodulation,[status(thm)],[c_76,c_623]) ).
tcf(c_625,plain,
$false,
inference(ground_joinability,[status(thm)],[c_624,c_261,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP703-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 15:45:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running UEQ theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.40/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.40/1.28 % SZS status Started for theBenchmark.p
% 2.40/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.40/1.28
% 2.40/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.40/1.28
% 2.40/1.28 % ------ iProver source info
% 2.40/1.28
% 2.40/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.40/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.40/1.28 % git: non_committed_changes: false
% 2.40/1.28
% 2.40/1.28 % ------ Parsing...% successful
% 2.40/1.28
% 2.40/1.28
% 2.40/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.40/1.28
% 2.40/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.40/1.28
% 2.40/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.40/1.28
% 2.40/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.40/1.28 % ------ Proving...
% 2.40/1.28 % ------ Problem Properties
% 2.40/1.28
% 2.40/1.28 %
% 2.40/1.28 % clauses 14
% 2.40/1.28 % conjectures 1
% 2.40/1.28 % EPR 0
% 2.40/1.28 % Horn 14
% 2.40/1.28 % unary 14
% 2.40/1.28 % binary 0
% 2.40/1.28 % lits 14
% 2.40/1.28 % lits eq 14
% 2.40/1.28 % fd_pure 0
% 2.40/1.28 % fd_pseudo 0
% 2.40/1.28 % fd_cond 0
% 2.40/1.28 % fd_pseudo_cond 0
% 2.40/1.28 % AC symbols 0
% 2.40/1.28
% 2.40/1.28 % ------ Input Options Time Limit: Unbounded
% 2.40/1.28
% 2.40/1.28
% 2.40/1.28 % ------
% 2.40/1.28 % Current options:
% 2.40/1.28 % ------
% 2.40/1.28
% 2.40/1.28
% 2.40/1.28 %
% 2.40/1.28
% 2.40/1.28 % ------ Proving...
% 2.40/1.28 %
% 2.40/1.28
% 2.40/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.40/1.28
% 2.40/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.40/1.28
% 2.40/1.28
%------------------------------------------------------------------------------