%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP659-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 : n012.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:06 PM UTC 2026
% Result : Unsatisfiable 3.57s 1.01s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 6
% Syntax : Number of formulae : 49 ( 49 unt; 0 def)
% Number of atoms : 49 ( 48 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 : 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 : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 99 ( 0 sgn 99 !; 0 ?; 87 :)
% 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,mult(X1,X2)),X1) = mult(mult(X0,X1),mult(X2,X1)),
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)),X1) = mult(mult(X0,X1),mult(X2,X1)),
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_138,plain,
! [X0: $i,X1: $i] : rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_55,c_58]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(rd(X0,mult(X1,X2)),X1),mult(X2,X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_57,c_59]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(ld(X1,X2),X1)) = mult(mult(X0,X2),X1),
inference(superposition,[status(thm)],[c_55,c_59]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(rd(X0,mult(X1,rd(X2,X1))),X1),X2) = mult(X0,X1),
inference(superposition,[status(thm)],[c_57,c_144]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(X0,mult(X1,X2)),X1) = rd(mult(X0,X1),mult(X2,X1)),
inference(superposition,[status(thm)],[c_144,c_58]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i,X2: $i] : ld(mult(rd(X0,mult(X1,X2)),X1),mult(X0,X1)) = mult(X2,X1),
inference(superposition,[status(thm)],[c_144,c_56]) ).
tcf(c_190,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(rd(X0,X1),X2),X1) = mult(X0,mult(ld(X1,X2),X1)),
inference(superposition,[status(thm)],[c_57,c_146]) ).
tcf(c_326,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(X0,mult(X1,rd(X2,X1))),X1) = rd(mult(X0,X1),X2),
inference(superposition,[status(thm)],[c_166,c_58]) ).
tcf(c_435,plain,
! [X0: $i,X1: $i,X2: $i] : ld(mult(rd(X0,X1),X2),mult(X0,X2)) = mult(ld(X2,X1),X2),
inference(superposition,[status(thm)],[c_55,c_170]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i] : mult(X0,mult(ld(X1,X1),X1)) = mult(X0,X1),
inference(superposition,[status(thm)],[c_57,c_190]) ).
tcf(c_635,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = mult(ld(X1,X1),X1),
inference(superposition,[status(thm)],[c_471,c_56]) ).
tcf(c_659,plain,
! [X0: $i] : mult(ld(X0,X0),X0) = X0,
inference(light_normalisation,[status(thm)],[c_635,c_56]) ).
tcf(c_726,plain,
! [X0: $i] : ld(X0,X0) = rd(X0,X0),
inference(superposition,[status(thm)],[c_659,c_58]) ).
tcf(c_763,plain,
! [X0: $i,X1: $i] : ld(mult(X0,X1),mult(X0,X1)) = mult(rd(X0,mult(X1,X0)),X1),
inference(superposition,[status(thm)],[c_726,c_169]) ).
tcf(c_921,plain,
! [X0: $i,X1: $i,X2: $i] : ld(mult(X0,X1),mult(X2,X1)) = mult(ld(X1,ld(X0,X2)),X1),
inference(superposition,[status(thm)],[c_138,c_435]) ).
tcf(c_1831,plain,
! [X0: $i,X1: $i] : mult(ld(X0,ld(X1,X1)),X0) = mult(rd(X1,mult(X0,X1)),X0),
inference(demodulation,[status(thm)],[c_763,c_921]) ).
tcf(c_1853,plain,
! [X0: $i,X1: $i] : rd(mult(ld(X0,ld(X1,X1)),X0),X0) = rd(X1,mult(X0,X1)),
inference(superposition,[status(thm)],[c_1831,c_58]) ).
tcf(c_3057,plain,
! [X0: $i,X1: $i] : ld(X0,ld(X1,X1)) = rd(X1,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_1853,c_58]) ).
tcf(c_3082,plain,
! [X0: $i] : ld(ld(X0,X0),ld(X0,X0)) = rd(X0,X0),
inference(superposition,[status(thm)],[c_659,c_3057]) ).
tcf(c_3089,plain,
! [X0: $i,X1: $i] : ld(ld(X0,ld(X1,X1)),X1) = mult(X0,X1),
inference(superposition,[status(thm)],[c_3057,c_136]) ).
tcf(c_3101,plain,
! [X0: $i] : ld(ld(X0,X0),ld(X0,X0)) = ld(X0,X0),
inference(light_normalisation,[status(thm)],[c_3082,c_726]) ).
tcf(c_3187,plain,
! [X0: $i,X1: $i] : mult(rd(ld(X0,X0),X1),X0) = ld(X1,X0),
inference(superposition,[status(thm)],[c_136,c_3089]) ).
tcf(c_3398,plain,
! [X0: $i,X1: $i] : ld(mult(X0,rd(X1,X0)),X0) = rd(mult(ld(X0,X0),X0),X1),
inference(superposition,[status(thm)],[c_3187,c_326]) ).
tcf(c_3404,plain,
! [X0: $i,X1: $i] : ld(mult(X0,rd(X1,X0)),X0) = rd(X0,X1),
inference(light_normalisation,[status(thm)],[c_3398,c_659]) ).
tcf(c_3586,plain,
! [X0: $i,X1: $i] : ld(mult(X0,X1),X0) = rd(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_58,c_3404]) ).
tcf(c_3616,plain,
! [X0: $i,X1: $i] : ld(mult(X0,X1),X0) = ld(X1,ld(X0,X0)),
inference(demodulation,[status(thm)],[c_3586,c_3057]) ).
tcf(c_3638,plain,
! [X0: $i,X1: $i] : rd(X0,ld(X1,ld(X0,X0))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_3616,c_138]) ).
tcf(c_3661,plain,
! [X0: $i,X1: $i] : rd(X0,ld(X1,ld(ld(X0,X0),ld(X0,X0)))) = mult(X0,mult(ld(X0,X0),X1)),
inference(superposition,[status(thm)],[c_3616,c_3638]) ).
tcf(c_3681,plain,
! [X0: $i,X1: $i] : mult(X0,mult(ld(X0,X0),X1)) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_3661,c_3101,c_3638]) ).
tcf(c_6619,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = mult(ld(X0,X0),X1),
inference(superposition,[status(thm)],[c_3681,c_56]) ).
tcf(c_6668,plain,
! [X0: $i,X1: $i] : mult(ld(X0,X0),X1) = X1,
inference(light_normalisation,[status(thm)],[c_6619,c_56]) ).
tcf(c_6791,plain,
! [X0: $i,X1: $i] : ld(X0,X0) = rd(X1,X1),
inference(superposition,[status(thm)],[c_6668,c_58]) ).
tcf(c_6810,plain,
! [X0: $i] : tuple(x1(ld(X0,X0)),mult(x1_2(ld(X0,X0)),ld(X0,X0))) != tuple(x1(ld(X0,X0)),x1_2(ld(X0,X0))),
inference(superposition,[status(thm)],[c_6668,c_60]) ).
tcf(c_6921,plain,
! [X0: $i,X1: $i] : mult(X0,rd(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_6791,c_55]) ).
tcf(c_7287,plain,
! [X0: $i] : tuple(x1(rd(X0,X0)),mult(x1_2(rd(X0,X0)),rd(X0,X0))) != tuple(x1(rd(X0,X0)),x1_2(rd(X0,X0))),
inference(superposition,[status(thm)],[c_6791,c_6810]) ).
tcf(c_7290,plain,
$false,
inference(ground_joinability,[status(thm)],[c_7287,c_6921]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP659-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Wed Sep 23 15:31:08 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.05/0.33 Running UEQ theorem proving
% 0.05/0.33 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.07/0.33
% 0.07/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33
% 0.07/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 3.57/1.01 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.57/1.01 % SZS status Started for theBenchmark.p
% 3.57/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 3.57/1.01
% 3.57/1.01 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.57/1.01
% 3.57/1.01 % ------ iProver source info
% 3.57/1.01
% 3.57/1.01 % git: date: 2026-07-19 20:42:38 +0200
% 3.57/1.01 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.57/1.01 % git: non_committed_changes: false
% 3.57/1.01
% 3.57/1.01 % ------ Parsing...% successful
% 3.57/1.01
% 3.57/1.01
% 3.57/1.01 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.57/1.01
% 3.57/1.01 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.57/1.01
% 3.57/1.01 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.57/1.01
% 3.57/1.01 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.57/1.01 % ------ Proving...
% 3.57/1.01 % ------ Problem Properties
% 3.57/1.01
% 3.57/1.01 %
% 3.57/1.01 % clauses 6
% 3.57/1.01 % conjectures 1
% 3.57/1.01 % EPR 0
% 3.57/1.01 % Horn 6
% 3.57/1.01 % unary 6
% 3.57/1.01 % binary 0
% 3.57/1.01 % lits 6
% 3.57/1.01 % lits eq 6
% 3.57/1.01 % fd_pure 0
% 3.57/1.01 % fd_pseudo 0
% 3.57/1.01 % fd_cond 0
% 3.57/1.01 % fd_pseudo_cond 0
% 3.57/1.01 % AC symbols 0
% 3.57/1.01
% 3.57/1.01 % ------ Input Options Time Limit: Unbounded
% 3.57/1.01
% 3.57/1.01
% 3.57/1.01 % ------
% 3.57/1.01 % Current options:
% 3.57/1.01 % ------
% 3.57/1.01
% 3.57/1.01
% 3.57/1.01 %
% 3.57/1.01
% 3.57/1.01 % ------ Proving...
% 3.57/1.01 %
% 3.57/1.01
% 3.57/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 3.57/1.01
% 3.57/1.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.01
% 3.57/1.01
%------------------------------------------------------------------------------