%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP703-10 : 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 : 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:35:15 PM UTC 2026
% Result : Unsatisfiable 2.34s 1.18s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 17 unt; 0 def)
% Number of atoms : 17 ( 16 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
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(f8,axiom,
! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
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(op_e,mult(x2,x3)) != mult(mult(op_e,x2),x3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
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_70,plain,
! [X0: $i,X1: $i] : mult(mult(op_c,X0),X1) = mult(op_c,mult(X0,X1)),
inference(cnf_transformation,[],[f8]) ).
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(op_e,x2),x3) != mult(op_e,mult(x2,x3)),
inference(cnf_transformation,[],[f14]) ).
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_621,plain,
op_c = op_e,
inference(demodulation,[status(thm)],[c_372,c_65]) ).
tcf(c_622,plain,
mult(mult(op_c,x2),x3) != mult(op_c,mult(x2,x3)),
inference(demodulation,[status(thm)],[c_76,c_621]) ).
tcf(c_623,plain,
$false,
inference(ground_joinability,[status(thm)],[c_622,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP703-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 15:48:23 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running UEQ theorem proving
% 0.10/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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 2.34/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.34/1.18 % SZS status Started for theBenchmark.p
% 2.34/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.34/1.18
% 2.34/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.34/1.18
% 2.34/1.18 % ------ iProver source info
% 2.34/1.18
% 2.34/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.34/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.34/1.18 % git: non_committed_changes: false
% 2.34/1.18
% 2.34/1.18 % ------ Parsing...% successful
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.34/1.18
% 2.34/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.34/1.18
% 2.34/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.34/1.18
% 2.34/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.34/1.18 % ------ Proving...
% 2.34/1.18 % ------ Problem Properties
% 2.34/1.18
% 2.34/1.18 %
% 2.34/1.18 % clauses 14
% 2.34/1.18 % conjectures 1
% 2.34/1.18 % EPR 0
% 2.34/1.18 % Horn 14
% 2.34/1.18 % unary 14
% 2.34/1.18 % binary 0
% 2.34/1.18 % lits 14
% 2.34/1.18 % lits eq 14
% 2.34/1.18 % fd_pure 0
% 2.34/1.18 % fd_pseudo 0
% 2.34/1.18 % fd_cond 0
% 2.34/1.18 % fd_pseudo_cond 0
% 2.34/1.18 % AC symbols 0
% 2.34/1.18
% 2.34/1.18 % ------ Input Options Time Limit: Unbounded
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 % ------
% 2.34/1.18 % Current options:
% 2.34/1.18 % ------
% 2.34/1.18
% 2.34/1.18
% 2.34/1.18 %
% 2.34/1.18
% 2.34/1.18 % ------ Proving...
% 2.34/1.18 %
% 2.34/1.18
% 2.34/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 2.34/1.18
% 2.34/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.34/1.19
% 2.34/1.19
%------------------------------------------------------------------------------