%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP613-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:51 PM UTC 2026
% Result : Unsatisfiable 2.79s 1.16s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 11 ( 3 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 : 36 ( 0 sgn 36 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(definition_unfolding,[],[f3,f2,f2]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),inverse(X3))),double_divide(X0,X2))),X1) = X3,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(inverse(X0),double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(inverse(X2)))),X3)),double_divide(X1,X3)))),X0) = X2,
inference(superposition,[status(thm)],[c_95,c_95]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X0) = X1,
inference(demodulation,[status(thm)],[c_121,c_52]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_156,c_52]) ).
tcf(c_241,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_162,c_156]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X0),X0)),inverse(X1))),inverse(X2))),X2) = X1,
inference(superposition,[status(thm)],[c_241,c_52]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X1) = X0,
inference(light_normalisation,[status(thm)],[c_278,c_241]) ).
tcf(c_674,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),X0) = double_divide(inverse(X1),X1),
inference(superposition,[status(thm)],[c_241,c_286]) ).
tcf(c_700,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_286,c_241]) ).
tcf(c_870,plain,
inverse(double_divide(a1,inverse(a1))) = inverse(double_divide(a1,inverse(a1))),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_882,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),X0) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_700,c_674]) ).
tcf(c_937,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_882,c_882]) ).
tcf(c_990,plain,
! [X0: $i] : inverse(double_divide(X0,inverse(X0))) != inverse(double_divide(a1,inverse(a1))),
inference(superposition,[status(thm)],[c_937,c_53]) ).
tcf(c_995,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(a1,inverse(a1))),
inference(instantiation,[status(thm)],[c_990]) ).
tcf(c_996,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_995,c_870]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP613-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n015.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.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 15:16:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running UEQ theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 2.79/1.16 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.79/1.16 % SZS status Started for theBenchmark.p
% 2.79/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.16
% 2.79/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.79/1.16
% 2.79/1.16 % ------ iProver source info
% 2.79/1.16
% 2.79/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 2.79/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.79/1.16 % git: non_committed_changes: false
% 2.79/1.16
% 2.79/1.16 % ------ Parsing...% successful
% 2.79/1.16
% 2.79/1.16
% 2.79/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.79/1.16
% 2.79/1.16 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.79/1.16
% 2.79/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.79/1.16
% 2.79/1.16 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.79/1.16 % ------ Proving...
% 2.79/1.16 % ------ Problem Properties
% 2.79/1.16
% 2.79/1.16 %
% 2.79/1.16 % clauses 2
% 2.79/1.16 % conjectures 1
% 2.79/1.16 % EPR 0
% 2.79/1.16 % Horn 2
% 2.79/1.16 % unary 2
% 2.79/1.16 % binary 0
% 2.79/1.16 % lits 2
% 2.79/1.16 % lits eq 2
% 2.79/1.16 % fd_pure 0
% 2.79/1.16 % fd_pseudo 0
% 2.79/1.16 % fd_cond 0
% 2.79/1.16 % fd_pseudo_cond 0
% 2.79/1.16 % AC symbols 0
% 2.79/1.16
% 2.79/1.16 % ------ Input Options Time Limit: Unbounded
% 2.79/1.16
% 2.79/1.16
% 2.79/1.16 % ------
% 2.79/1.16 % Current options:
% 2.79/1.16 % ------
% 2.79/1.16
% 2.79/1.16
% 2.79/1.16 %
% 2.79/1.16
% 2.79/1.16 % ------ Proving...
% 2.79/1.16 %
% 2.79/1.16
% 2.79/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 2.79/1.16
% 2.79/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.79/1.16
% 2.79/1.16
%------------------------------------------------------------------------------