%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP574-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 : n012.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:45 PM UTC 2026
% Result : Unsatisfiable 0.60s 0.97s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 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 : 27 ( 0 sgn 27 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(X0,double_divide(double_divide(X1,double_divide(X2,X0)),double_divide(X2,identity))),double_divide(identity,identity)) = X1,
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,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f6,plain,
a2 != multiply(identity,a2),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f8,plain,
a2 != double_divide(double_divide(a2,identity),identity),
inference(definition_unfolding,[],[f6,f2]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,double_divide(double_divide(X1,double_divide(X2,X0)),double_divide(X2,identity))),double_divide(identity,identity)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i] : double_divide(X0,double_divide(X0,identity)) = identity,
inference(cnf_transformation,[],[f7]) ).
tcf(c_56,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(cnf_transformation,[],[f8]) ).
tcf(c_94,plain,
! [X0: $i] : double_divide(double_divide(identity,double_divide(identity,double_divide(X0,identity))),double_divide(identity,identity)) = X0,
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(double_divide(X0,identity),double_divide(double_divide(X1,identity),double_divide(X0,identity))),double_divide(identity,identity)) = X1,
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_103,plain,
double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity,
inference(superposition,[status(thm)],[c_55,c_94]) ).
tcf(c_106,plain,
! [X0: $i] : double_divide(double_divide(double_divide(X0,identity),X0),double_divide(identity,identity)) = identity,
inference(superposition,[status(thm)],[c_94,c_54]) ).
tcf(c_111,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(identity,identity),
inference(superposition,[status(thm)],[c_103,c_54]) ).
tcf(c_119,plain,
! [X0: $i] : double_divide(double_divide(identity,double_divide(identity,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(double_divide(X0,identity),X0),
inference(superposition,[status(thm)],[c_106,c_54]) ).
tcf(c_120,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),double_divide(identity,identity)) = double_divide(double_divide(identity,X0),identity),
inference(superposition,[status(thm)],[c_106,c_54]) ).
tcf(c_122,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),X0) = double_divide(identity,identity),
inference(light_normalisation,[status(thm)],[c_119,c_111]) ).
tcf(c_123,plain,
double_divide(double_divide(identity,identity),identity) = identity,
inference(demodulation,[status(thm)],[c_103,c_120]) ).
tcf(c_132,plain,
double_divide(identity,identity) = identity,
inference(demodulation,[status(thm)],[c_123,c_122]) ).
tcf(c_137,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),X0) = identity,
inference(light_normalisation,[status(thm)],[c_122,c_132]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(double_divide(X0,identity),double_divide(double_divide(X1,identity),double_divide(X0,identity))),identity) = X1,
inference(light_normalisation,[status(thm)],[c_96,c_132]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,double_divide(double_divide(X1,identity),X0)),identity) = X1,
inference(superposition,[status(thm)],[c_140,c_140]) ).
tcf(c_192,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),identity) = double_divide(double_divide(identity,X0),identity),
inference(light_normalisation,[status(thm)],[c_120,c_132]) ).
tcf(c_193,plain,
double_divide(double_divide(identity,a2),identity) != a2,
inference(demodulation,[status(thm)],[c_56,c_192]) ).
tcf(c_232,plain,
! [X0: $i] : double_divide(double_divide(X0,identity),identity) = X0,
inference(superposition,[status(thm)],[c_137,c_151]) ).
tcf(c_250,plain,
! [X0: $i] : double_divide(double_divide(identity,X0),identity) = X0,
inference(demodulation,[status(thm)],[c_192,c_232]) ).
tcf(c_251,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_193,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP574-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Wed Sep 23 15:06:37 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33 Running UEQ theorem proving
% 0.07/0.33 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.07/0.34
% 0.07/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34
% 0.07/0.34 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 0.60/0.97 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.60/0.97 % SZS status Started for theBenchmark.p
% 0.60/0.97 % SZS status Unsatisfiable for theBenchmark.p
% 0.60/0.97
% 0.60/0.97 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.60/0.97
% 0.60/0.97 % ------ iProver source info
% 0.60/0.97
% 0.60/0.97 % git: date: 2026-07-19 20:42:38 +0200
% 0.60/0.97 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.60/0.97 % git: non_committed_changes: false
% 0.60/0.97
% 0.60/0.97 % ------ Parsing...% successful
% 0.60/0.97
% 0.60/0.97
% 0.60/0.97 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.60/0.97
% 0.60/0.97 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.60/0.97
% 0.60/0.97 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.60/0.97
% 0.60/0.97 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.60/0.97 % ------ Proving...
% 0.60/0.97 % ------ Problem Properties
% 0.60/0.97
% 0.60/0.97 %
% 0.60/0.97 % clauses 3
% 0.60/0.97 % conjectures 1
% 0.60/0.97 % EPR 0
% 0.60/0.97 % Horn 3
% 0.60/0.97 % unary 3
% 0.60/0.97 % binary 0
% 0.60/0.97 % lits 3
% 0.60/0.97 % lits eq 3
% 0.60/0.97 % fd_pure 0
% 0.60/0.97 % fd_pseudo 0
% 0.60/0.97 % fd_cond 0
% 0.60/0.97 % fd_pseudo_cond 0
% 0.60/0.97 % AC symbols 0
% 0.60/0.97
% 0.60/0.97 % ------ Input Options Time Limit: Unbounded
% 0.60/0.97
% 0.60/0.97
% 0.60/0.97 % ------
% 0.60/0.97 % Current options:
% 0.60/0.97 % ------
% 0.60/0.97
% 0.60/0.97
% 0.60/0.97 %
% 0.60/0.97
% 0.60/0.97 % ------ Proving...
% 0.60/0.97 %
% 0.60/0.97
% 0.60/0.97 % SZS status Unsatisfiable for theBenchmark.p
% 0.60/0.97
% 0.60/0.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.60/0.97
% 0.60/0.97
%------------------------------------------------------------------------------