%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP710-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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:17 PM UTC 2026
% Result : Unsatisfiable 3.20s 1.17s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : mult(X0,unit) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
fof(f2,axiom,
! [X0] : mult(unit,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f3,axiom,
! [X2,X0,X1] : mult(X0,mult(X1,mult(X1,X2))) = mult(mult(mult(X0,X1),X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
fof(f6,axiom,
! [X0] : mult(i(X0),X0) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
fof(f7,plain,
! [X0] : unit = mult(i(X0),X0),
inference(reorient_equations,[],[f6]) ).
fof(f8,negated_conjecture,
! [X0] : mult(X0,x4) != x3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
tcf(c_55,plain,
! [X0: $i] : mult(X0,unit) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i] : mult(unit,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(mult(X0,X1),X1),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_59,plain,
! [X0: $i] : mult(i(X0),X0) = unit,
inference(cnf_transformation,[],[f7]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] : mult(X0,x4) != x3,
inference(cnf_transformation,[],[f8]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(superposition,[status(thm)],[c_57,c_55]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(mult(X0,X1),X1),mult(X2,mult(X2,X3))),
inference(superposition,[status(thm)],[c_57,c_57]) ).
tcf(c_1014,plain,
! [X0: $i,X1: $i] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
inference(demodulation,[status(thm)],[c_129,c_55]) ).
tcf(c_1015,plain,
! [X0: $i,X1: $i,X2: $i] : mult(mult(X0,mult(X1,X1)),X2) = mult(X0,mult(X1,mult(X1,X2))),
inference(demodulation,[status(thm)],[c_57,c_1014]) ).
tcf(c_1021,plain,
! [X0: $i] : mult(i(X0),mult(X0,X0)) = mult(unit,X0),
inference(superposition,[status(thm)],[c_59,c_1014]) ).
tcf(c_1031,plain,
! [X0: $i] : mult(X0,mult(x4,x4)) != x3,
inference(superposition,[status(thm)],[c_1014,c_60]) ).
tcf(c_1060,plain,
! [X0: $i] : mult(i(X0),mult(X0,X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1021,c_56]) ).
tcf(c_1432,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(mult(X0,mult(X1,X1)),mult(X2,mult(X2,X3))),
inference(light_normalisation,[status(thm)],[c_130,c_1014]) ).
tcf(c_1433,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : mult(mult(mult(X0,mult(X1,mult(X1,X2))),X2),X3) = mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,X3))))),
inference(demodulation,[status(thm)],[c_1432,c_1015]) ).
tcf(c_1546,plain,
! [X0: $i,X1: $i,X2: $i] : mult(X0,mult(X1,mult(X1,mult(X2,mult(X2,mult(x4,x4)))))) != x3,
inference(superposition,[status(thm)],[c_1433,c_1031]) ).
tcf(c_2317,plain,
! [X0: $i,X1: $i] : mult(X0,mult(X1,mult(X1,mult(x4,x4)))) != x3,
inference(superposition,[status(thm)],[c_56,c_1546]) ).
tcf(c_2688,plain,
! [X0: $i] : mult(X0,mult(i(x4),x4)) != x3,
inference(superposition,[status(thm)],[c_1060,c_2317]) ).
tcf(c_3287,plain,
! [X0: $i] : X0 != x3,
inference(demodulation,[status(thm)],[c_2688,c_55,c_59]) ).
tcf(c_3288,plain,
$false,
inference(equality_resolution,[status(thm)],[c_3287]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP710-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 15:48:02 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running UEQ theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 3.20/1.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.20/1.17 % SZS status Started for theBenchmark.p
% 3.20/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.20/1.17
% 3.20/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.20/1.17
% 3.20/1.17 % ------ iProver source info
% 3.20/1.17
% 3.20/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.20/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.20/1.17 % git: non_committed_changes: false
% 3.20/1.17
% 3.20/1.17 % ------ Parsing...% successful
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.20/1.17
% 3.20/1.17 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.20/1.17
% 3.20/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.20/1.17
% 3.20/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.20/1.17 % ------ Proving...
% 3.20/1.17 % ------ Problem Properties
% 3.20/1.17
% 3.20/1.17 %
% 3.20/1.17 % clauses 6
% 3.20/1.17 % conjectures 1
% 3.20/1.17 % EPR 0
% 3.20/1.17 % Horn 6
% 3.20/1.17 % unary 6
% 3.20/1.17 % binary 0
% 3.20/1.17 % lits 6
% 3.20/1.17 % lits eq 6
% 3.20/1.17 % fd_pure 0
% 3.20/1.17 % fd_pseudo 0
% 3.20/1.17 % fd_cond 0
% 3.20/1.17 % fd_pseudo_cond 0
% 3.20/1.17 % AC symbols 0
% 3.20/1.17
% 3.20/1.17 % ------ Input Options Time Limit: Unbounded
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 % ------
% 3.20/1.17 % Current options:
% 3.20/1.17 % ------
% 3.20/1.17
% 3.20/1.17
% 3.20/1.17 %
% 3.20/1.17
% 3.20/1.17 % ------ Proving...
% 3.20/1.17 %
% 3.20/1.17
% 3.20/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.20/1.17
% 3.20/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.20/1.17
% 3.20/1.17
%------------------------------------------------------------------------------