%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP702-12 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:14 PM UTC 2026
% Result : Unsatisfiable 0.73s 1.06s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 11 unt; 0 def)
% Number of atoms : 11 ( 10 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 : 3 ( 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; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f10,axiom,
! [X0,X1] : mult(X0,mult(op_c,X1)) = mult(mult(X0,op_c),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f11,axiom,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f14,negated_conjecture,
mult(x0,mult(op_d,x1)) != mult(mult(x0,op_d),x1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : mult(mult(X0,op_c),X1) = mult(X0,mult(op_c,X1)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_73,plain,
! [X0: $i] : ld(X0,mult(op_c,X0)) = op_d,
inference(cnf_transformation,[],[f11]) ).
tcf(c_76,negated_conjecture,
mult(mult(x0,op_d),x1) != mult(x0,mult(op_d,x1)),
inference(cnf_transformation,[],[f14]) ).
tcf(c_211,plain,
op_c = op_d,
inference(superposition,[status(thm)],[c_73,c_64]) ).
tcf(c_214,plain,
mult(mult(x0,op_c),x1) != mult(x0,mult(op_c,x1)),
inference(demodulation,[status(thm)],[c_76,c_211]) ).
tcf(c_215,plain,
$false,
inference(ground_joinability,[status(thm)],[c_214,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP702-12 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 15:45:59 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running UEQ theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 0.73/1.06 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.73/1.06 % SZS status Started for theBenchmark.p
% 0.73/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.06
% 0.73/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.73/1.06
% 0.73/1.06 % ------ iProver source info
% 0.73/1.06
% 0.73/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 0.73/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.73/1.06 % git: non_committed_changes: false
% 0.73/1.06
% 0.73/1.06 % ------ Parsing...% successful
% 0.73/1.06
% 0.73/1.06
% 0.73/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.73/1.06
% 0.73/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.73/1.06
% 0.73/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.73/1.06
% 0.73/1.06 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.73/1.06 % ------ Proving...
% 0.73/1.06 % ------ Problem Properties
% 0.73/1.06
% 0.73/1.06 %
% 0.73/1.06 % clauses 14
% 0.73/1.06 % conjectures 1
% 0.73/1.06 % EPR 0
% 0.73/1.06 % Horn 14
% 0.73/1.06 % unary 14
% 0.73/1.06 % binary 0
% 0.73/1.06 % lits 14
% 0.73/1.06 % lits eq 14
% 0.73/1.06 % fd_pure 0
% 0.73/1.06 % fd_pseudo 0
% 0.73/1.06 % fd_cond 0
% 0.73/1.06 % fd_pseudo_cond 0
% 0.73/1.06 % AC symbols 0
% 0.73/1.06
% 0.73/1.06 % ------ Input Options Time Limit: Unbounded
% 0.73/1.06
% 0.73/1.06
% 0.73/1.06 % ------
% 0.73/1.06 % Current options:
% 0.73/1.06 % ------
% 0.73/1.06
% 0.73/1.06
% 0.73/1.06 %
% 0.73/1.06
% 0.73/1.06 % ------ Proving...
% 0.73/1.06 %
% 0.73/1.06
% 0.73/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 0.73/1.06
% 0.73/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.06
% 0.73/1.06
%------------------------------------------------------------------------------