%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP686-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 : n015.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.37s 2.79s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 60 ( 60 unt; 0 def)
% Number of atoms : 77 ( 59 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn 115 !; 0 ?; 102 :)
% 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(f6,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
fof(f7,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X1,X2))) = mult(mult(X0,mult(X1,X1)),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
fof(f8,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,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_62,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(cnf_transformation,[],[f7]) ).
tcf(c_64,negated_conjecture,
mult(mult(a,mult(a,b)),c) != mult(mult(a,a),mult(b,c)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_79,plain,
! [X0: $i] : ld(X0,X0) = unit,
inference(superposition,[status(thm)],[c_61,c_58]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] : rd(X0,ld(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_57,c_60]) ).
tcf(c_85,plain,
! [X0: $i] : rd(X0,unit) = X0,
inference(superposition,[status(thm)],[c_61,c_60]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(X0,mult(X1,X1)),mult(X1,mult(X1,X2))) = mult(X0,X2),
inference(superposition,[status(thm)],[c_59,c_63]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] : mult(unit,mult(X0,mult(X0,X1))) = mult(mult(X0,X0),X1),
inference(superposition,[status(thm)],[c_62,c_63]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(X1,ld(mult(X0,mult(X1,X1)),X2)))) = X2,
inference(superposition,[status(thm)],[c_63,c_57]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X0),X1) = mult(X0,mult(X0,X1)),
inference(demodulation,[status(thm)],[c_90,c_62]) ).
tcf(c_104,plain,
mult(mult(a,mult(a,b)),c) != mult(a,mult(a,mult(b,c))),
inference(demodulation,[status(thm)],[c_64,c_101]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(mult(X0,X0),X1))) = X1,
inference(superposition,[status(thm)],[c_101,c_57]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,X1),mult(X2,mult(X2,X1))) = rd(X0,mult(X2,X2)),
inference(superposition,[status(thm)],[c_89,c_60]) ).
tcf(c_218,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X0,ld(mult(X1,mult(X0,X0)),X2))) = ld(X1,X2),
inference(superposition,[status(thm)],[c_95,c_58]) ).
tcf(c_595,plain,
! [X0: $i,X1: $i] : mult(X0,ld(mult(X0,X0),X1)) = ld(X0,X1),
inference(superposition,[status(thm)],[c_170,c_58]) ).
tcf(c_1098,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,ld(mult(X1,X1),X2)),X2) = rd(X0,mult(X1,X1)),
inference(superposition,[status(thm)],[c_170,c_194]) ).
tcf(c_1099,plain,
! [X0: $i,X1: $i,X2: $i] : rd(mult(X0,ld(X1,X2)),mult(X1,X2)) = rd(X0,mult(X1,X1)),
inference(superposition,[status(thm)],[c_57,c_194]) ).
tcf(c_1146,plain,
! [X0: $i,X1: $i,X2: $i] : ld(rd(X0,mult(X1,X1)),X2) = mult(X1,mult(X1,ld(X0,X2))),
inference(superposition,[status(thm)],[c_59,c_218]) ).
tcf(c_2081,plain,
! [X0: $i,X1: $i] : rd(ld(X0,X1),X1) = rd(X0,mult(X0,X0)),
inference(superposition,[status(thm)],[c_595,c_1098]) ).
tcf(c_2100,plain,
! [X0: $i,X1: $i] : rd(X0,mult(X0,X0)) = rd(X1,mult(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_1099]) ).
tcf(c_2116,plain,
! [X0: $i,X1: $i] : rd(mult(X0,ld(X1,unit)),X1) = rd(X0,mult(X1,X1)),
inference(superposition,[status(thm)],[c_61,c_1099]) ).
tcf(c_2150,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(X1,rd(X1,mult(X0,X0))))) = unit,
inference(superposition,[status(thm)],[c_1146,c_79]) ).
tcf(c_3899,plain,
! [X0: $i] : rd(X0,mult(X0,X0)) = ld(X0,unit),
inference(superposition,[status(thm)],[c_2081,c_85]) ).
tcf(c_3929,plain,
! [X0: $i,X1: $i,X2: $i] : ld(rd(X0,mult(X1,X0)),X2) = mult(X1,mult(X1,ld(X1,X2))),
inference(superposition,[status(thm)],[c_2100,c_1146]) ).
tcf(c_3933,plain,
! [X0: $i,X1: $i,X2: $i] : rd(ld(X0,X1),X1) = rd(X2,mult(X0,X2)),
inference(superposition,[status(thm)],[c_2100,c_2081]) ).
tcf(c_4009,plain,
! [X0: $i] : rd(X0,mult(X0,X0)) = rd(unit,X0),
inference(superposition,[status(thm)],[c_57,c_2116]) ).
tcf(c_4066,plain,
! [X0: $i,X1: $i] : rd(mult(X0,ld(X1,rd(X1,mult(X0,X0)))),unit) = rd(X0,mult(X0,X0)),
inference(superposition,[status(thm)],[c_2150,c_2100]) ).
tcf(c_4072,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X1,rd(X1,mult(X0,X0)))) = ld(X0,unit),
inference(superposition,[status(thm)],[c_2150,c_58]) ).
tcf(c_4093,plain,
! [X0: $i,X1: $i] : rd(ld(X0,X1),X1) = iPr_def_10(X0),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_3933]) ).
tcf(c_4094,plain,
! [X0: $i,X1: $i] : rd(X0,mult(X1,X0)) = iPr_def_10(X1),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_3933]) ).
tcf(c_4108,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(X0,X1))) = ld(iPr_def_10(X0),X1),
inference(demodulation,[status(thm)],[c_3929,c_4094]) ).
tcf(c_4109,plain,
! [X0: $i,X1: $i] : ld(iPr_def_10(X0),X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_4108,c_57]) ).
tcf(c_4119,plain,
! [X0: $i] : ld(X0,unit) = iPr_def_10(X0),
inference(demodulation,[status(thm)],[c_4066,c_3899,c_4072,c_4093]) ).
tcf(c_5032,plain,
! [X0: $i] : rd(unit,iPr_def_10(X0)) = X0,
inference(superposition,[status(thm)],[c_4119,c_84]) ).
tcf(c_5036,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(X1,unit))) = iPr_def_10(rd(X1,mult(X0,X0))),
inference(superposition,[status(thm)],[c_4119,c_1146]) ).
tcf(c_5053,plain,
! [X0: $i,X1: $i] : iPr_def_10(rd(X0,X1)) = rd(X1,X0),
inference(superposition,[status(thm)],[c_59,c_4094]) ).
tcf(c_5143,plain,
! [X0: $i] : rd(unit,X0) = iPr_def_10(X0),
inference(superposition,[status(thm)],[c_4009,c_4094]) ).
tcf(c_5188,plain,
! [X0: $i] : iPr_def_10(iPr_def_10(X0)) = X0,
inference(demodulation,[status(thm)],[c_5032,c_5143]) ).
tcf(c_5217,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,ld(X1,unit))) = rd(mult(X0,X0),X1),
inference(demodulation,[status(thm)],[c_5036,c_5053]) ).
tcf(c_5218,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X0,iPr_def_10(X1))) = rd(mult(X0,X0),X1),
inference(demodulation,[status(thm)],[c_5217,c_4119]) ).
tcf(c_5366,plain,
! [X0: $i,X1: $i,X2: $i] : ld(rd(X0,X1),X2) = mult(rd(X1,X0),X2),
inference(superposition,[status(thm)],[c_5053,c_4109]) ).
tcf(c_5644,plain,
! [X0: $i,X1: $i,X2: $i] : mult(rd(mult(X0,X0),X1),X2) = mult(X0,mult(X0,ld(X1,X2))),
inference(demodulation,[status(thm)],[c_1146,c_5366]) ).
tcf(c_6546,plain,
! [X0: $i,X1: $i] : rd(mult(X0,X0),iPr_def_10(X1)) = mult(X0,mult(X0,X1)),
inference(superposition,[status(thm)],[c_5188,c_5218]) ).
tcf(c_6995,plain,
! [X0: $i,X1: $i] : rd(iPr_def_10(X0),mult(X1,X1)) = iPr_def_10(mult(X1,mult(X1,X0))),
inference(superposition,[status(thm)],[c_6546,c_5053]) ).
tcf(c_11125,plain,
! [X0: $i,X1: $i,X2: $i] : ld(iPr_def_10(mult(X0,mult(X0,X1))),X2) = mult(rd(mult(X0,X0),iPr_def_10(X1)),X2),
inference(superposition,[status(thm)],[c_6995,c_5366]) ).
tcf(c_11338,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X0,X1)),X2) = mult(X0,mult(X0,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_11125,c_4109,c_5644]) ).
tcf(c_11401,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_104,c_11338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP686-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.10/0.37 % Computer : n015.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 15:45:40 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running UEQ theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 3.37/2.79 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.37/2.79 % SZS status Started for theBenchmark.p
% 3.37/2.79 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/2.79
% 3.37/2.79 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.37/2.79
% 3.37/2.79 % ------ iProver source info
% 3.37/2.79
% 3.37/2.79 % git: date: 2026-07-19 20:42:38 +0200
% 3.37/2.79 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.37/2.79 % git: non_committed_changes: false
% 3.37/2.79
% 3.37/2.79 % ------ Parsing...% successful
% 3.37/2.79
% 3.37/2.79
% 3.37/2.79 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.37/2.79 % ------ Proving...
% 3.37/2.79 % ------ Problem Properties
% 3.37/2.79
% 3.37/2.79 %
% 3.37/2.79 % clauses 8
% 3.37/2.79 % conjectures 1
% 3.37/2.79 % EPR 0
% 3.37/2.79 % Horn 8
% 3.37/2.79 % unary 8
% 3.37/2.79 % binary 0
% 3.37/2.79 % lits 8
% 3.37/2.79 % lits eq 8
% 3.37/2.79 % fd_pure 0
% 3.37/2.79 % fd_pseudo 0
% 3.37/2.79 % fd_cond 0
% 3.37/2.79 % fd_pseudo_cond 0
% 3.37/2.79 % AC symbols 0
% 3.37/2.79
% 3.37/2.79 % ------ Input Options Time Limit: Unbounded
% 3.37/2.79
% 3.37/2.79
% 3.37/2.79 % ------
% 3.37/2.79 % Current options:
% 3.37/2.79 % ------
% 3.37/2.79
% 3.37/2.79
% 3.37/2.79 %
% 3.37/2.79
% 3.37/2.79 % ------ Proving...
% 3.37/2.79 %
% 3.37/2.79
% 3.37/2.79 % SZS status Unsatisfiable for theBenchmark.p
% 3.37/2.79
% 3.37/2.79 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.37/2.79
% 3.37/2.79
%------------------------------------------------------------------------------