%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP656-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 : n010.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:05 PM UTC 2026
% Result : Unsatisfiable 0.90s 11.47s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 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; 0 con; 1-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?; 46 :)
% 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(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f5,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,X0)) = mult(mult(X0,mult(X1,X2)),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f6,negated_conjecture,
! [X0] : tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X2)),X0) = mult(mult(X0,X1),mult(X2,X0)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] : tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] : ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(ld(X1,X2),X0)) = mult(mult(X0,X2),X0),
inference(superposition,[status(thm)],[c_55,c_59]) ).
tcf(c_147,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,rd(X1,X2)),mult(X2,X0)) = mult(mult(X0,X1),X0),
inference(superposition,[status(thm)],[c_57,c_59]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(mult(X0,X1),mult(X2,X0)),X0) = mult(X0,mult(X1,X2)),
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_240,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,rd(X1,rd(X2,X0))),X2) = mult(mult(X0,X1),X0),
inference(superposition,[status(thm)],[c_57,c_147]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,ld(X1,X2))) = rd(mult(mult(X0,X2),X0),X0),
inference(superposition,[status(thm)],[c_146,c_149]) ).
tcf(c_562,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,rd(X1,rd(X2,X0))) = rd(mult(mult(X0,X1),X0),X2),
inference(superposition,[status(thm)],[c_240,c_58]) ).
tcf(c_642,plain,
! [X0: $i,X1: $i] : mult(X0,rd(X1,rd(X0,X0))) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_330,c_55,c_562]) ).
tcf(c_647,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = rd(X1,rd(X0,X0)),
inference(superposition,[status(thm)],[c_642,c_56]) ).
tcf(c_655,plain,
! [X0: $i,X1: $i] : rd(X0,rd(X1,X1)) = X0,
inference(light_normalisation,[status(thm)],[c_647,c_56]) ).
tcf(c_680,plain,
! [X0: $i,X1: $i] : ld(X0,X0) = rd(X1,X1),
inference(superposition,[status(thm)],[c_655,c_136]) ).
tcf(c_681,plain,
! [X0: $i,X1: $i] : mult(X0,rd(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_655,c_57]) ).
tcf(c_723,plain,
! [X0: $i,X1: $i] : mult(ld(X0,X0),X1) = X1,
inference(superposition,[status(thm)],[c_680,c_57]) ).
tcf(c_777,plain,
! [X0: $i] : tuple(mult(rd(X0,X0),x1(rd(X0,X0))),x1_2(rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
inference(superposition,[status(thm)],[c_681,c_60]) ).
tcf(c_841,plain,
! [X0: $i] : tuple(mult(ld(X0,X0),x1(ld(X0,X0))),x1_2(ld(X0,X0))) != tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))),
inference(superposition,[status(thm)],[c_680,c_777]) ).
tcf(c_843,plain,
$false,
inference(ground_joinability,[status(thm)],[c_841,c_723]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP656-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/10.66 % Computer : n010.cluster.edu
% 0.17/10.66 % Model : x86_64 x86_64
% 0.17/10.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.66 % Memory : 8046.5625MB
% 0.17/10.66 % OS : Linux 6.8.0-71-generic
% 0.17/10.66 % CPULimit : 300
% 0.17/10.66 % WCLimit : 300
% 0.17/10.66 % DateTime : Wed Sep 23 15:31:25 UTC 2026
% 0.17/10.66 % CPUTime :
% 0.17/10.66 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/10.69 Running UEQ theorem proving
% 0.17/10.70 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.21/10.71
% 0.21/10.71 % ======== iProver multi-core TPTP/SMT =========
% 0.21/10.71
% 0.21/10.71 % Detected problem language: tptp
% 0.21/10.72 % Proving...
% 0.90/11.47 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.90/11.47 % SZS status Started for theBenchmark.p
% 0.90/11.47 % SZS status Unsatisfiable for theBenchmark.p
% 0.90/11.47
% 0.90/11.47 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.90/11.47
% 0.90/11.47 % ------ iProver source info
% 0.90/11.47
% 0.90/11.47 % git: date: 2026-07-19 20:42:38 +0200
% 0.90/11.47 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.90/11.47 % git: non_committed_changes: false
% 0.90/11.47
% 0.90/11.47 % ------ Parsing...% successful
% 0.90/11.47
% 0.90/11.47
% 0.90/11.47 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.90/11.47
% 0.90/11.47 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.90/11.47
% 0.90/11.47 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.90/11.47
% 0.90/11.47 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.90/11.47 % ------ Proving...
% 0.90/11.47 % ------ Problem Properties
% 0.90/11.47
% 0.90/11.47 %
% 0.90/11.47 % clauses 6
% 0.90/11.47 % conjectures 1
% 0.90/11.47 % EPR 0
% 0.90/11.47 % Horn 6
% 0.90/11.47 % unary 6
% 0.90/11.47 % binary 0
% 0.90/11.47 % lits 6
% 0.90/11.47 % lits eq 6
% 0.90/11.47 % fd_pure 0
% 0.90/11.47 % fd_pseudo 0
% 0.90/11.47 % fd_cond 0
% 0.90/11.47 % fd_pseudo_cond 0
% 0.90/11.47 % AC symbols 0
% 0.90/11.47
% 0.90/11.47 % ------ Input Options Time Limit: Unbounded
% 0.90/11.47
% 0.90/11.47
% 0.90/11.47 % ------
% 0.90/11.47 % Current options:
% 0.90/11.47 % ------
% 0.90/11.47
% 0.90/11.47
% 0.90/11.47 %
% 0.90/11.47
% 0.90/11.47 % ------ Proving...
% 0.90/11.47 %
% 0.90/11.47
% 0.90/11.47 % SZS status Unsatisfiable for theBenchmark.p
% 0.90/11.47
% 0.90/11.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.90/11.47
% 0.90/11.47
%------------------------------------------------------------------------------