%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP482-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:34:23 PM UTC 2026
% Result : Unsatisfiable 1.53s 6.20s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : double_divide(double_divide(double_divide(X0,double_divide(X1,identity)),double_divide(double_divide(X2,double_divide(X3,double_divide(X3,identity))),double_divide(X0,identity))),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,plain,
! [X0] : double_divide(X0,identity) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f6,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f7,plain,
a2 != multiply(identity,a2),
inference(reorient_equations,[],[f6]) ).
fof(f8,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f5,f4]) ).
fof(f9,plain,
a2 != double_divide(double_divide(a2,identity),identity),
inference(definition_unfolding,[],[f7,f2]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(double_divide(double_divide(X0,double_divide(X1,identity)),double_divide(double_divide(X2,double_divide(X3,double_divide(X3,identity))),double_divide(X0,identity))),X1) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i] : double_divide(X0,double_divide(X0,identity)) = identity,
inference(cnf_transformation,[],[f8]) ).
tcf(c_56,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(cnf_transformation,[],[f9]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(double_divide(X0,double_divide(X1,identity)),double_divide(double_divide(X2,identity),double_divide(X0,identity))),X1) = X2,
inference(demodulation,[status(thm)],[c_54,c_55]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(identity,double_divide(double_divide(X0,identity),double_divide(X1,identity))),X1) = X0,
inference(superposition,[status(thm)],[c_55,c_65]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(double_divide(double_divide(X0,identity),double_divide(X1,identity)),identity),X1) = X0,
inference(superposition,[status(thm)],[c_55,c_65]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(double_divide(double_divide(X0,X1),double_divide(double_divide(X2,identity),double_divide(X0,identity))),double_divide(double_divide(X3,double_divide(identity,identity)),double_divide(double_divide(X1,identity),double_divide(X3,identity)))) = X2,
inference(superposition,[status(thm)],[c_65,c_65]) ).
tcf(c_112,plain,
! [X0: $i] : double_divide(double_divide(identity,identity),double_divide(X0,identity)) = X0,
inference(superposition,[status(thm)],[c_55,c_95]) ).
tcf(c_165,plain,
double_divide(identity,identity) = identity,
inference(superposition,[status(thm)],[c_55,c_112]) ).
tcf(c_167,plain,
! [X0: $i] : double_divide(identity,double_divide(X0,identity)) = X0,
inference(demodulation,[status(thm)],[c_112,c_165]) ).
tcf(c_170,plain,
! [X0: $i] : double_divide(double_divide(double_divide(identity,double_divide(X0,identity)),identity),X0) = identity,
inference(superposition,[status(thm)],[c_165,c_98]) ).
tcf(c_179,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),X0) = identity,
inference(light_normalisation,[status(thm)],[c_170,c_167]) ).
tcf(c_201,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(double_divide(double_divide(X0,X1),double_divide(double_divide(X2,identity),double_divide(X0,identity))),double_divide(double_divide(X3,identity),double_divide(double_divide(X1,identity),double_divide(X3,identity)))) = X2,
inference(light_normalisation,[status(thm)],[c_101,c_165]) ).
tcf(c_206,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(double_divide(double_divide(X0,identity),X1),identity),double_divide(double_divide(X2,identity),double_divide(double_divide(X1,identity),double_divide(X2,identity)))) = X0,
inference(superposition,[status(thm)],[c_55,c_201]) ).
tcf(c_373,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(double_divide(X0,X1),identity),double_divide(double_divide(X2,identity),double_divide(double_divide(X1,identity),double_divide(X2,identity)))) = double_divide(X0,identity),
inference(superposition,[status(thm)],[c_179,c_201]) ).
tcf(c_381,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),identity) = X0,
inference(demodulation,[status(thm)],[c_206,c_373]) ).
tcf(c_382,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_381]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP482-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n004.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Wed Sep 23 14:52:26 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running UEQ theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 1.53/6.20 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.53/6.20 % SZS status Started for theBenchmark.p
% 1.53/6.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.53/6.20
% 1.53/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.53/6.20
% 1.53/6.20 % ------ iProver source info
% 1.53/6.20
% 1.53/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 1.53/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.53/6.20 % git: non_committed_changes: false
% 1.53/6.20
% 1.53/6.20 % ------ Parsing...% successful
% 1.53/6.20
% 1.53/6.20
% 1.53/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.53/6.20 % ------ Proving...
% 1.53/6.20 % ------ Problem Properties
% 1.53/6.20
% 1.53/6.20 %
% 1.53/6.20 % clauses 3
% 1.53/6.20 % conjectures 1
% 1.53/6.20 % EPR 0
% 1.53/6.20 % Horn 3
% 1.53/6.20 % unary 3
% 1.53/6.20 % binary 0
% 1.53/6.20 % lits 3
% 1.53/6.20 % lits eq 3
% 1.53/6.20 % fd_pure 0
% 1.53/6.20 % fd_pseudo 0
% 1.53/6.20 % fd_cond 0
% 1.53/6.20 % fd_pseudo_cond 0
% 1.53/6.20 % AC symbols 0
% 1.53/6.20
% 1.53/6.20 % ------ Input Options Time Limit: Unbounded
% 1.53/6.20
% 1.53/6.20
% 1.53/6.20 % ------
% 1.53/6.20 % Current options:
% 1.53/6.20 % ------
% 1.53/6.20
% 1.53/6.20
% 1.53/6.20 %
% 1.53/6.20
% 1.53/6.20 % ------ Proving...
% 1.53/6.20 %
% 1.53/6.20
% 1.53/6.20 % SZS status Unsatisfiable for theBenchmark.p
% 1.53/6.20
% 1.53/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.53/6.20
% 1.53/6.20
%------------------------------------------------------------------------------