%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP710-10 : 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 : n017.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:16 PM UTC 2026
% Result : Unsatisfiable 2.42s 1.27s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 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 : 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 38 :)
% 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,X0) != x1,
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,X0) != x1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
inference(superposition,[status(thm)],[c_59,c_57]) ).
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_134,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_128,c_56]) ).
tcf(c_145,plain,
! [X0: $i] : mult(i(X0),mult(X0,X0)) = X0,
inference(superposition,[status(thm)],[c_55,c_134]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] : mult(i(i(X0)),mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_134,c_134]) ).
tcf(c_175,plain,
! [X0: $i] : mult(i(i(X0)),mult(i(X0),X0)) = X0,
inference(superposition,[status(thm)],[c_145,c_134]) ).
tcf(c_178,plain,
! [X0: $i] : mult(i(i(X0)),unit) = X0,
inference(light_normalisation,[status(thm)],[c_175,c_59]) ).
tcf(c_192,plain,
! [X0: $i] : i(i(X0)) = X0,
inference(demodulation,[status(thm)],[c_178,c_55]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(i(X0),X1),
inference(superposition,[status(thm)],[c_192,c_134]) ).
tcf(c_350,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_351,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_350]) ).
tcf(c_443,plain,
! [X0: $i,X1: $i] : mult(X0,mult(i(X0),mult(X0,X1))) = mult(X0,X1),
inference(light_normalisation,[status(thm)],[c_150,c_192]) ).
tcf(c_505,plain,
! [X0: $i] : mult(i(x0),X0) != x1,
inference(superposition,[status(thm)],[c_194,c_60]) ).
tcf(c_593,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(unit,X1),
inference(superposition,[status(thm)],[c_59,c_351]) ).
tcf(c_714,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
inference(demodulation,[status(thm)],[c_593,c_56]) ).
tcf(c_737,plain,
! [X0: $i,X1: $i] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(i(X0),mult(X0,X1)),
inference(superposition,[status(thm)],[c_443,c_714]) ).
tcf(c_754,plain,
! [X0: $i,X1: $i] : mult(i(X0),mult(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_737,c_714]) ).
tcf(c_1186,plain,
! [X0: $i] : X0 != x1,
inference(superposition,[status(thm)],[c_754,c_505]) ).
tcf(c_1205,plain,
$false,
inference(equality_resolution,[status(thm)],[c_1186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP710-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 15:43:15 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 2.42/1.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.42/1.27 % SZS status Started for theBenchmark.p
% 2.42/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.42/1.27
% 2.42/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.42/1.27
% 2.42/1.27 % ------ iProver source info
% 2.42/1.27
% 2.42/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.42/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.42/1.27 % git: non_committed_changes: false
% 2.42/1.27
% 2.42/1.27 % ------ Parsing...% successful
% 2.42/1.27
% 2.42/1.27
% 2.42/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.42/1.27
% 2.42/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.42/1.27
% 2.42/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.42/1.27
% 2.42/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.42/1.27 % ------ Proving...
% 2.42/1.27 % ------ Problem Properties
% 2.42/1.27
% 2.42/1.27 %
% 2.42/1.27 % clauses 6
% 2.42/1.27 % conjectures 1
% 2.42/1.27 % EPR 0
% 2.42/1.27 % Horn 6
% 2.42/1.27 % unary 6
% 2.42/1.27 % binary 0
% 2.42/1.27 % lits 6
% 2.42/1.27 % lits eq 6
% 2.42/1.27 % fd_pure 0
% 2.42/1.27 % fd_pseudo 0
% 2.42/1.27 % fd_cond 0
% 2.42/1.27 % fd_pseudo_cond 0
% 2.42/1.27 % AC symbols 0
% 2.42/1.27
% 2.42/1.27 % ------ Input Options Time Limit: Unbounded
% 2.42/1.27
% 2.42/1.27
% 2.42/1.27 % ------
% 2.42/1.27 % Current options:
% 2.42/1.27 % ------
% 2.42/1.27
% 2.42/1.27
% 2.42/1.27 %
% 2.42/1.27
% 2.42/1.27 % ------ Proving...
% 2.42/1.27 %
% 2.42/1.27
% 2.42/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 2.42/1.27
% 2.42/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.42/1.27
% 2.42/1.27
%------------------------------------------------------------------------------