%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP750-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 : 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:21 PM UTC 2026
% Result : Unsatisfiable 9.12s 2.40s
% Output : CNFRefutation 12.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 40 unt; 6 def)
% Number of atoms : 100 ( 39 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f5,axiom,
! [X2,X0,X1] : mult(mult(X0,mult(X0,X0)),mult(X1,X2)) = mult(mult(X0,X1),mult(mult(X0,X0),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f6,axiom,
! [X2,X0,X1] : mult(mult(X0,X1),mult(X2,X2)) = mult(mult(X0,X2),mult(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
fof(f7,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X0,X0)),mult(X1,X2)) = mult(mult(X0,X1),mult(mult(X0,X0),X2)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,X1)) = mult(mult(X0,X2),mult(X1,X1)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_88,definition,
iPr_def_10 = mult(a,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_89,definition,
iPr_def_11 = mult(b,c),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_90,definition,
iPr_def_12 = mult(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_91,definition,
iPr_def_13 = mult(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_92,definition,
iPr_def_14 = mult(a,c),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_93,definition,
iPr_def_15 = mult(iPr_def_13,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_94,negated_conjecture,
iPr_def_12 != iPr_def_15,
inference(demodulation,[status(thm)],[c_62,c_92,c_91,c_93,c_89,c_88,c_90]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,X1),mult(X2,X1)) = mult(mult(X0,X2),mult(X1,X1)),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X0,X0)),mult(X1,X2)) = mult(mult(X0,X1),mult(mult(X0,X0),X2)),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] : ld(X0,mult(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] : mult(X0,ld(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_168,plain,
ld(a,iPr_def_14) = c,
inference(superposition,[status(thm)],[c_92,c_99]) ).
tcf(c_169,plain,
ld(iPr_def_10,iPr_def_12) = iPr_def_11,
inference(superposition,[status(thm)],[c_90,c_99]) ).
tcf(c_170,plain,
ld(iPr_def_13,iPr_def_15) = iPr_def_14,
inference(superposition,[status(thm)],[c_93,c_99]) ).
tcf(c_241,plain,
! [X0: $i] : mult(mult(a,X0),mult(a,X0)) = mult(iPr_def_10,mult(X0,X0)),
inference(superposition,[status(thm)],[c_88,c_95]) ).
tcf(c_243,plain,
! [X0: $i] : mult(mult(a,X0),mult(b,X0)) = mult(iPr_def_13,mult(X0,X0)),
inference(superposition,[status(thm)],[c_91,c_95]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i] : mult(mult(a,X0),mult(iPr_def_10,X1)) = mult(mult(a,iPr_def_10),mult(X0,X1)),
inference(superposition,[status(thm)],[c_88,c_96]) ).
tcf(c_411,plain,
mult(a,c) = iPr_def_14,
inference(superposition,[status(thm)],[c_168,c_100]) ).
tcf(c_412,plain,
mult(iPr_def_10,iPr_def_11) = iPr_def_12,
inference(superposition,[status(thm)],[c_169,c_100]) ).
tcf(c_413,plain,
mult(iPr_def_13,iPr_def_14) = iPr_def_15,
inference(superposition,[status(thm)],[c_170,c_100]) ).
tcf(c_517,plain,
mult(iPr_def_10,mult(c,c)) = mult(iPr_def_14,iPr_def_14),
inference(superposition,[status(thm)],[c_92,c_241]) ).
tcf(c_547,plain,
mult(mult(a,c),iPr_def_11) = mult(iPr_def_13,mult(c,c)),
inference(superposition,[status(thm)],[c_89,c_243]) ).
tcf(c_652,plain,
mult(iPr_def_13,mult(c,c)) = mult(iPr_def_14,iPr_def_11),
inference(demodulation,[status(thm)],[c_547,c_411]) ).
tcf(c_6491,plain,
! [X0: $i] : mult(mult(a,iPr_def_10),mult(X0,iPr_def_11)) = mult(mult(a,X0),iPr_def_12),
inference(superposition,[status(thm)],[c_412,c_285]) ).
tcf(c_6507,plain,
mult(mult(a,iPr_def_13),mult(iPr_def_10,mult(c,c))) = mult(mult(a,iPr_def_10),mult(iPr_def_14,iPr_def_11)),
inference(superposition,[status(thm)],[c_652,c_285]) ).
tcf(c_6718,plain,
mult(mult(a,iPr_def_13),mult(iPr_def_10,mult(c,c))) = mult(mult(a,iPr_def_14),iPr_def_12),
inference(demodulation,[status(thm)],[c_6507,c_6491]) ).
tcf(c_6719,plain,
mult(mult(a,iPr_def_14),iPr_def_12) = mult(mult(a,iPr_def_14),iPr_def_15),
inference(demodulation,[status(thm)],[c_6718,c_95,c_413,c_517]) ).
tcf(c_6957,plain,
ld(mult(a,iPr_def_14),mult(mult(a,iPr_def_14),iPr_def_12)) = iPr_def_15,
inference(superposition,[status(thm)],[c_6719,c_99]) ).
tcf(c_7321,plain,
iPr_def_12 = iPr_def_15,
inference(demodulation,[status(thm)],[c_6957,c_99]) ).
tcf(c_7322,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7321,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP750-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.39 % Computer : n010.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Wed Sep 23 15:56:42 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.44 Running UEQ theorem proving
% 0.11/0.44 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.46
% 0.11/0.46 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.46
% 0.11/0.46 % Detected problem language: tptp
% 0.11/0.49 % Proving...
% 9.12/2.40 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 9.12/2.40 % SZS status Started for theBenchmark.p
% 9.12/2.40 % SZS status Unsatisfiable for theBenchmark.p
% 9.12/2.40
% 9.12/2.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 9.12/2.40
% 9.12/2.40 % ------ iProver source info
% 9.12/2.40
% 9.12/2.40 % git: date: 2026-07-19 20:42:38 +0200
% 9.12/2.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 9.12/2.40 % git: non_committed_changes: false
% 9.12/2.40
% 9.12/2.40 % ------ Parsing...% successful
% 9.12/2.40
% 9.12/2.40
% 9.12/2.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 9.12/2.40
% 9.12/2.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 9.12/2.40
% 9.12/2.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 9.12/2.40
% 9.12/2.40 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 9.12/2.40 % ------ Proving...
% 9.12/2.40 % ------ Problem Properties
% 9.12/2.40
% 9.12/2.40 %
% 9.12/2.40 % clauses 13
% 9.12/2.40 % conjectures 1
% 9.12/2.40 % EPR 1
% 9.12/2.40 % Horn 13
% 9.12/2.40 % unary 13
% 9.12/2.40 % binary 0
% 9.12/2.40 % lits 13
% 9.12/2.40 % lits eq 13
% 9.12/2.40 % fd_pure 0
% 9.12/2.40 % fd_pseudo 0
% 9.12/2.40 % fd_cond 0
% 9.12/2.40 % fd_pseudo_cond 0
% 9.12/2.40 % AC symbols 0
% 9.12/2.40
% 9.12/2.40 % ------ Input Options Time Limit: Unbounded
% 9.12/2.40
% 9.12/2.40
% 9.12/2.40 % ------
% 9.12/2.40 % Current options:
% 9.12/2.40 % ------
% 9.12/2.40
% 9.12/2.40
% 9.12/2.40 %
% 9.12/2.40
% 9.12/2.40 % ------ Proving...
% 9.12/2.40 %
% 9.12/2.40
% 9.12/2.40 % SZS status Unsatisfiable for theBenchmark.p
% 9.12/2.40
% 9.12/2.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.09/2.40
% 12.09/2.40
%------------------------------------------------------------------------------