%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP593-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 : n002.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:48 PM UTC 2026
% Result : Unsatisfiable 1.21s 1.06s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of formulae : 43 ( 43 unt; 0 def)
% Number of atoms : 43 ( 42 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 : 98 ( 0 sgn 98 !; 0 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
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(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
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_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(double_divide(X0,inverse(double_divide(X1,inverse(double_divide(X2,X3))))),inverse(double_divide(X0,X2)))) = double_divide(X1,X3),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(double_divide(X0,X1),inverse(double_divide(X2,X1))),X2)) = X0,
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(double_divide(X0,inverse(double_divide(X1,inverse(double_divide(X2,X3))))),X2),double_divide(X1,X3))) = X0,
inference(superposition,[status(thm)],[c_52,c_95]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X2)))) = double_divide(double_divide(X2,X3),inverse(double_divide(X1,X3))),
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(inverse(double_divide(X0,X1)),X2),inverse(double_divide(X1,X2))) = X0,
inference(superposition,[status(thm)],[c_101,c_52]) ).
tcf(c_191,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,X2)))),X1)) = X2,
inference(superposition,[status(thm)],[c_101,c_95]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(double_divide(X0,X1),inverse(double_divide(inverse(double_divide(X2,inverse(double_divide(X0,X3)))),X1))) = double_divide(X2,X3),
inference(superposition,[status(thm)],[c_52,c_172]) ).
tcf(c_340,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(double_divide(inverse(double_divide(X0,X1)),X2),X2),inverse(X0))) = X1,
inference(superposition,[status(thm)],[c_172,c_52]) ).
tcf(c_522,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X0,X1),X2)),X1)))) = X2,
inference(superposition,[status(thm)],[c_95,c_191]) ).
tcf(c_621,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(double_divide(X0,inverse(double_divide(X1,X2))),X1)),X2) = X0,
inference(superposition,[status(thm)],[c_93,c_95]) ).
tcf(c_1794,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(double_divide(X0,X1),X1),X2)) = inverse(double_divide(X0,X2)),
inference(superposition,[status(thm)],[c_319,c_522]) ).
tcf(c_1833,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),inverse(X0))) = X1,
inference(demodulation,[status(thm)],[c_340,c_1794]) ).
tcf(c_1933,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(double_divide(double_divide(X0,X1),X2)),X1)) = inverse(double_divide(X2,inverse(X0))),
inference(superposition,[status(thm)],[c_522,c_1833]) ).
tcf(c_1949,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(X0,inverse(X1)),inverse(double_divide(X0,X2)))) = inverse(double_divide(X1,X2)),
inference(superposition,[status(thm)],[c_1833,c_52]) ).
tcf(c_1967,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(double_divide(X1,inverse(X0))))) = X1,
inference(demodulation,[status(thm)],[c_522,c_1933]) ).
tcf(c_2127,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(X0,X1),inverse(X2))) = double_divide(inverse(double_divide(X2,X0)),X1),
inference(superposition,[status(thm)],[c_172,c_1967]) ).
tcf(c_2140,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(double_divide(X0,X1),X1),double_divide(X2,inverse(X2)))) = X0,
inference(superposition,[status(thm)],[c_1967,c_98]) ).
tcf(c_2145,plain,
! [X0: $i,X1: $i] : inverse(double_divide(double_divide(X0,inverse(X1)),X0)) = X1,
inference(superposition,[status(thm)],[c_1967,c_1967]) ).
tcf(c_2271,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_172,c_2145]) ).
tcf(c_2283,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,X1),inverse(double_divide(X2,X1))) = double_divide(X2,inverse(X0)),
inference(superposition,[status(thm)],[c_2145,c_172]) ).
tcf(c_2294,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_2145,c_621]) ).
tcf(c_2295,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),inverse(X1)) = inverse(double_divide(X0,X1)),
inference(superposition,[status(thm)],[c_2145,c_1967]) ).
tcf(c_2300,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(inverse(double_divide(X1,X0)))) = X1,
inference(demodulation,[status(thm)],[c_172,c_2283]) ).
tcf(c_2409,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_2294,c_621]) ).
tcf(c_2441,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X1,X0)) = X1,
inference(demodulation,[status(thm)],[c_2300,c_2271]) ).
tcf(c_2442,plain,
! [X0: $i,X1: $i] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_2294,c_2441]) ).
tcf(c_2444,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_2441,c_2294]) ).
tcf(c_2640,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(X2)))) = inverse(double_divide(X2,X1)),
inference(demodulation,[status(thm)],[c_1949,c_2127,c_2409]) ).
tcf(c_2657,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,X1),inverse(double_divide(X2,X1))) = inverse(double_divide(X0,inverse(X2))),
inference(superposition,[status(thm)],[c_2640,c_2444]) ).
tcf(c_2666,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(X1))) = double_divide(X1,inverse(X0)),
inference(light_normalisation,[status(thm)],[c_2657,c_2283]) ).
tcf(c_2670,plain,
inverse(double_divide(b1,inverse(b1))) != double_divide(a1,inverse(a1)),
inference(demodulation,[status(thm)],[c_53,c_2666]) ).
tcf(c_2765,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(X1))) = double_divide(inverse(X0),X1),
inference(superposition,[status(thm)],[c_2271,c_2295]) ).
tcf(c_2773,plain,
double_divide(a1,inverse(a1)) != double_divide(b1,inverse(b1)),
inference(demodulation,[status(thm)],[c_2670,c_2442,c_2765]) ).
tcf(c_3188,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,double_divide(X1,inverse(X1)))) = X0,
inference(demodulation,[status(thm)],[c_2140,c_2441,c_2442]) ).
tcf(c_3202,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X1,inverse(X1))) = inverse(X0),
inference(superposition,[status(thm)],[c_3188,c_2271]) ).
tcf(c_3372,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_3202,c_2444]) ).
tcf(c_3381,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2773,c_3372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP593-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.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 15:13:03 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running UEQ theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 1.21/1.06 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.21/1.06 % SZS status Started for theBenchmark.p
% 1.21/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.06
% 1.21/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.21/1.06
% 1.21/1.06 % ------ iProver source info
% 1.21/1.06
% 1.21/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 1.21/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.21/1.06 % git: non_committed_changes: false
% 1.21/1.06
% 1.21/1.06 % ------ Parsing...% successful
% 1.21/1.06
% 1.21/1.06
% 1.21/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.21/1.06
% 1.21/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.21/1.06
% 1.21/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.21/1.06
% 1.21/1.06 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.21/1.06 % ------ Proving...
% 1.21/1.06 % ------ Problem Properties
% 1.21/1.06
% 1.21/1.06 %
% 1.21/1.06 % clauses 2
% 1.21/1.06 % conjectures 1
% 1.21/1.06 % EPR 0
% 1.21/1.06 % Horn 2
% 1.21/1.06 % unary 2
% 1.21/1.06 % binary 0
% 1.21/1.06 % lits 2
% 1.21/1.06 % lits eq 2
% 1.21/1.06 % fd_pure 0
% 1.21/1.06 % fd_pseudo 0
% 1.21/1.06 % fd_cond 0
% 1.21/1.06 % fd_pseudo_cond 0
% 1.21/1.06 % AC symbols 0
% 1.21/1.06
% 1.21/1.06 % ------ Input Options Time Limit: Unbounded
% 1.21/1.06
% 1.21/1.06
% 1.21/1.06 % ------
% 1.21/1.06 % Current options:
% 1.21/1.06 % ------
% 1.21/1.06
% 1.21/1.06
% 1.21/1.06 %
% 1.21/1.06
% 1.21/1.06 % ------ Proving...
% 1.21/1.06 %
% 1.21/1.06
% 1.21/1.06 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.06
% 1.21/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.21/1.06
% 1.21/1.06
%------------------------------------------------------------------------------