%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP609-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 : n001.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:50 PM UTC 2026
% Result : Unsatisfiable 4.09s 1.30s
% Output : CNFRefutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 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 : 9 ( 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 : 70 ( 0 sgn 70 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,X1)),X2)),double_divide(X0,X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/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] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,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_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(inverse(double_divide(inverse(double_divide(X2,X0)),X3)),X1))) = double_divide(X2,X3),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),double_divide(X1,X2)))) = X2,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(double_divide(X0,X1),double_divide(X2,double_divide(inverse(double_divide(inverse(double_divide(X0,X2)),X1)),X3)))) = X3,
inference(superposition,[status(thm)],[c_52,c_95]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X2,X1))) = double_divide(inverse(double_divide(X3,X2)),double_divide(X3,X0)),
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,X1)),double_divide(X0,inverse(double_divide(X1,X2)))) = X2,
inference(superposition,[status(thm)],[c_100,c_52]) ).
tcf(c_192,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(X0,X2))))) = X1,
inference(superposition,[status(thm)],[c_100,c_95]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(X0),double_divide(X1,double_divide(X1,inverse(double_divide(X2,X0)))))) = X2,
inference(superposition,[status(thm)],[c_173,c_52]) ).
tcf(c_348,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(X0,X1)),inverse(double_divide(X2,X3))) = inverse(double_divide(double_divide(X0,X2),double_divide(X1,X3))),
inference(superposition,[status(thm)],[c_173,c_98]) ).
tcf(c_624,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(X0,inverse(double_divide(X1,double_divide(inverse(double_divide(X0,X1)),X2)))) = X2,
inference(superposition,[status(thm)],[c_93,c_95]) ).
tcf(c_839,plain,
inverse(double_divide(a1,inverse(a1))) = inverse(double_divide(a1,inverse(a1))),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_1208,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,inverse(X1))),inverse(double_divide(X2,X1))) = double_divide(X0,X2),
inference(superposition,[status(thm)],[c_338,c_624]) ).
tcf(c_1577,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(X0,X1),double_divide(inverse(X2),X2))) = double_divide(X0,X1),
inference(demodulation,[status(thm)],[c_1208,c_348]) ).
tcf(c_1580,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,double_divide(inverse(X1),X1))) = X0,
inference(superposition,[status(thm)],[c_173,c_1577]) ).
tcf(c_1653,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),X2))) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_1580,c_93]) ).
tcf(c_1661,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(X0),inverse(double_divide(X1,X0)))) = X1,
inference(superposition,[status(thm)],[c_1580,c_192]) ).
tcf(c_1666,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_624,c_1653]) ).
tcf(c_1850,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,X1)),X2) = double_divide(X0,inverse(double_divide(X1,X2))),
inference(superposition,[status(thm)],[c_173,c_1666]) ).
tcf(c_1877,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_1666,c_192]) ).
tcf(c_2035,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(double_divide(X1,inverse(X1))))) = X0,
inference(demodulation,[status(thm)],[c_1877,c_1850]) ).
tcf(c_2045,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_2035,c_1661]) ).
tcf(c_2046,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,double_divide(X1,inverse(X1)))) = X0,
inference(superposition,[status(thm)],[c_2035,c_2035]) ).
tcf(c_2109,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X1,inverse(X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_2046,c_2045]) ).
tcf(c_2136,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_2109,c_1666]) ).
tcf(c_2372,plain,
! [X0: $i] : inverse(double_divide(X0,inverse(X0))) != inverse(double_divide(a1,inverse(a1))),
inference(superposition,[status(thm)],[c_2136,c_53]) ).
tcf(c_2377,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(a1,inverse(a1))),
inference(instantiation,[status(thm)],[c_2372]) ).
tcf(c_2378,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2377,c_839]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP609-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.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Wed Sep 23 15:18:05 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running UEQ theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 4.09/1.30 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 4.09/1.30 % SZS status Started for theBenchmark.p
% 4.09/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.30
% 4.09/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.09/1.30
% 4.09/1.30 % ------ iProver source info
% 4.09/1.30
% 4.09/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.09/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.09/1.30 % git: non_committed_changes: false
% 4.09/1.30
% 4.09/1.30 % ------ Parsing...% successful
% 4.09/1.30
% 4.09/1.30
% 4.09/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.09/1.30
% 4.09/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.09/1.30
% 4.09/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.09/1.30
% 4.09/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.09/1.30 % ------ Proving...
% 4.09/1.30 % ------ Problem Properties
% 4.09/1.30
% 4.09/1.30 %
% 4.09/1.30 % clauses 2
% 4.09/1.30 % conjectures 1
% 4.09/1.30 % EPR 0
% 4.09/1.30 % Horn 2
% 4.09/1.30 % unary 2
% 4.09/1.30 % binary 0
% 4.09/1.30 % lits 2
% 4.09/1.30 % lits eq 2
% 4.09/1.30 % fd_pure 0
% 4.09/1.30 % fd_pseudo 0
% 4.09/1.30 % fd_cond 0
% 4.09/1.30 % fd_pseudo_cond 0
% 4.09/1.30 % AC symbols 0
% 4.09/1.30
% 4.09/1.30 % ------ Input Options Time Limit: Unbounded
% 4.09/1.30
% 4.09/1.30
% 4.09/1.30 % ------
% 4.09/1.30 % Current options:
% 4.09/1.30 % ------
% 4.09/1.30
% 4.09/1.30
% 4.09/1.30 %
% 4.09/1.30
% 4.09/1.30 % ------ Proving...
% 4.09/1.30 %
% 4.09/1.30
% 4.09/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.09/1.30
% 4.09/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.09/1.30
% 4.09/1.30
%------------------------------------------------------------------------------