%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP687-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:12 PM UTC 2026
% Result : Unsatisfiable 3.03s 1.29s
% Output : CNFRefutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 39 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 81 !; 0 ?; 69 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
fof(f3,axiom,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
fof(f4,axiom,
! [X0,X1] : rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
fof(f5,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(mult(X0,X0),mult(X1,X2)) = mult(mult(X0,mult(X0,X1)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
fof(f8,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_61,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X0,X1)),X2) = mult(mult(X0,X0),mult(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,negated_conjecture,
mult(mult(a,mult(b,b)),c) != mult(a,mult(b,mult(b,c))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] : ld(rd(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_59,c_58]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i] : rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_57,c_60]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X0),mult(ld(X0,X1),X2)) = mult(mult(X0,X1),X2),
inference(superposition,[status(thm)],[c_57,c_63]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(mult(X0,X0),mult(X1,X2)),X2) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_63,c_60]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X0),mult(X1,unit)) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_63,c_61]) ).
tcf(c_199,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_175,c_61]) ).
tcf(c_351,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X0,mult(ld(X0,X1),X2))) = mult(mult(X0,X1),X2),
inference(demodulation,[status(thm)],[c_166,c_199]) ).
tcf(c_356,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),ld(ld(X0,X1),X2)) = mult(X0,mult(X0,X2)),
inference(superposition,[status(thm)],[c_57,c_351]) ).
tcf(c_681,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,mult(X0,mult(X1,X2))),X2) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_173,c_199]) ).
tcf(c_691,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X0,rd(X1,X2))) = rd(mult(X0,mult(X0,X1)),X2),
inference(superposition,[status(thm)],[c_59,c_681]) ).
tcf(c_888,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,ld(ld(X1,ld(X1,X0)),X2)) = mult(X1,mult(X1,X2)),
inference(superposition,[status(thm)],[c_57,c_356]) ).
tcf(c_890,plain,
! [X0: $i,X1: $i] : mult(X0,ld(ld(X0,unit),X1)) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_61,c_356]) ).
tcf(c_1003,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,mult(X0,X1))) = ld(ld(X0,unit),X1),
inference(superposition,[status(thm)],[c_890,c_58]) ).
tcf(c_1084,plain,
! [X0: $i,X1: $i] : ld(ld(X0,unit),X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_1003,c_58]) ).
tcf(c_1090,plain,
! [X0: $i,X1: $i] : mult(rd(unit,X0),X1) = ld(X0,X1),
inference(superposition,[status(thm)],[c_151,c_1084]) ).
tcf(c_1174,plain,
! [X0: $i] : ld(X0,unit) = rd(unit,X0),
inference(superposition,[status(thm)],[c_1090,c_61]) ).
tcf(c_2816,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,rd(unit,X1))) = rd(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c_61,c_691]) ).
tcf(c_3035,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(X1,unit))) = rd(mult(X0,X0),X1),
inference(demodulation,[status(thm)],[c_2816,c_1174]) ).
tcf(c_3065,plain,
! [X0: $i,X1: $i] : ld(X0,rd(mult(X0,X0),X1)) = mult(X0,ld(X1,unit)),
inference(superposition,[status(thm)],[c_3035,c_58]) ).
tcf(c_3719,plain,
! [X0: $i,X1: $i] : mult(X0,ld(ld(X1,mult(X0,X0)),unit)) = ld(X0,X1),
inference(superposition,[status(thm)],[c_156,c_3065]) ).
tcf(c_4104,plain,
! [X0: $i,X1: $i] : ld(ld(X0,mult(X1,X1)),unit) = ld(X1,ld(X1,X0)),
inference(superposition,[status(thm)],[c_3719,c_58]) ).
tcf(c_4263,plain,
! [X0: $i,X1: $i,X2: $i] : ld(ld(X0,ld(X0,X1)),X2) = mult(ld(X1,mult(X0,X0)),X2),
inference(superposition,[status(thm)],[c_4104,c_1084]) ).
tcf(c_4950,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(ld(X0,mult(X1,X1)),X2)) = mult(X1,mult(X1,X2)),
inference(demodulation,[status(thm)],[c_888,c_4263]) ).
tcf(c_5000,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(superposition,[status(thm)],[c_4950,c_351]) ).
tcf(c_5013,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_5000]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP687-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n007.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.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 15:40:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running UEQ theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 3.03/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.03/1.29 % SZS status Started for theBenchmark.p
% 3.03/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.03/1.29
% 3.03/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.03/1.29
% 3.03/1.29 % ------ iProver source info
% 3.03/1.29
% 3.03/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.03/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.03/1.29 % git: non_committed_changes: false
% 3.03/1.29
% 3.03/1.29 % ------ Parsing...% successful
% 3.03/1.29
% 3.03/1.29
% 3.03/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.03/1.29
% 3.03/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.03/1.29
% 3.03/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.03/1.29
% 3.03/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.03/1.29 % ------ Proving...
% 3.03/1.29 % ------ Problem Properties
% 3.03/1.29
% 3.03/1.29 %
% 3.03/1.29 % clauses 8
% 3.03/1.29 % conjectures 1
% 3.03/1.29 % EPR 0
% 3.03/1.29 % Horn 8
% 3.03/1.29 % unary 8
% 3.03/1.29 % binary 0
% 3.03/1.29 % lits 8
% 3.03/1.29 % lits eq 8
% 3.03/1.29 % fd_pure 0
% 3.03/1.29 % fd_pseudo 0
% 3.03/1.29 % fd_cond 0
% 3.03/1.29 % fd_pseudo_cond 0
% 3.03/1.29 % AC symbols 0
% 3.03/1.29
% 3.03/1.29 % ------ Input Options Time Limit: Unbounded
% 3.03/1.29
% 3.03/1.29
% 3.03/1.29 % ------
% 3.03/1.29 % Current options:
% 3.03/1.29 % ------
% 3.03/1.29
% 3.03/1.29
% 3.03/1.29 %
% 3.03/1.29
% 3.03/1.29 % ------ Proving...
% 3.03/1.29 %
% 3.03/1.29
% 3.03/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.03/1.29
% 3.03/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.03/1.29
% 3.03/1.29
%------------------------------------------------------------------------------