%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP469-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 : n007.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:20 PM UTC 2026
% Result : Unsatisfiable 3.77s 1.19s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 3
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 128 ( 0 sgn 128 !; 0 ?; 122 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
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,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(definition_unfolding,[],[f3,f2,f2]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(inverse(divide(X0,X1)),divide(divide(X2,divide(X3,X4)),X0)) = inverse(divide(X2,divide(X1,divide(X4,X3)))),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(divide(X0,divide(divide(X1,divide(divide(X2,X3),X0)),divide(X3,X2)))) = X1,
inference(superposition,[status(thm)],[c_97,c_52]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(inverse(divide(X0,divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))))) = X0,
inference(superposition,[status(thm)],[c_97,c_115]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : inverse(divide(divide(inverse(divide(divide(X0,X1),divide(X2,X3))),divide(X1,X0)),divide(X4,divide(X3,X2)))) = inverse(inverse(X4)),
inference(superposition,[status(thm)],[c_52,c_138]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(inverse(inverse(X0)),divide(divide(X1,X2),divide(inverse(divide(divide(X3,X4),divide(X1,X2))),divide(X4,X3)))) = X0,
inference(superposition,[status(thm)],[c_167,c_52]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(inverse(X0)),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))) = X0,
inference(superposition,[status(thm)],[c_253,c_253]) ).
tcf(c_357,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(X0),divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),X3))),inverse(inverse(X0)))) = X3,
inference(superposition,[status(thm)],[c_330,c_52]) ).
tcf(c_431,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),X3))),inverse(X0))) = X3,
inference(superposition,[status(thm)],[c_115,c_357]) ).
tcf(c_500,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(divide(inverse(X0),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2))))) = X0,
inference(superposition,[status(thm)],[c_431,c_115]) ).
tcf(c_573,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(X0,X1),divide(X2,X3))),divide(X1,X0)),divide(X4,divide(X3,X2))) = inverse(X4),
inference(superposition,[status(thm)],[c_52,c_500]) ).
tcf(c_706,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(divide(divide(X0,divide(divide(X1,X2),X3)),divide(X2,X1))) = inverse(divide(X0,inverse(X3))),
inference(superposition,[status(thm)],[c_573,c_115]) ).
tcf(c_976,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : inverse(divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0))) = inverse(divide(inverse(divide(X4,X1)),inverse(X4))),
inference(superposition,[status(thm)],[c_97,c_706]) ).
tcf(c_1013,plain,
! [X0: $i,X1: $i] : inverse(divide(inverse(divide(X0,X1)),inverse(X0))) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_976,c_52]) ).
tcf(c_1153,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(inverse(inverse(X0)),divide(X1,divide(inverse(divide(divide(X2,X3),X1)),divide(X3,X2)))) = divide(inverse(divide(X4,X0)),inverse(X4)),
inference(superposition,[status(thm)],[c_1013,c_330]) ).
tcf(c_1157,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
inference(light_normalisation,[status(thm)],[c_1153,c_330]) ).
tcf(c_1177,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,divide(divide(X1,X2),X3)),divide(X2,X1)) = divide(X0,inverse(X3)),
inference(superposition,[status(thm)],[c_115,c_1157]) ).
tcf(c_1186,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(divide(X0,X1),inverse(divide(divide(X1,X0),X2))),inverse(X3)) = divide(inverse(X2),inverse(X3)),
inference(superposition,[status(thm)],[c_431,c_1157]) ).
tcf(c_1204,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),inverse(inverse(divide(X1,X0)))) = inverse(X1),
inference(superposition,[status(thm)],[c_1157,c_1157]) ).
tcf(c_1219,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,divide(X1,inverse(X0)))) = X1,
inference(demodulation,[status(thm)],[c_115,c_1177]) ).
tcf(c_1222,plain,
! [X0: $i,X1: $i] : divide(X0,divide(inverse(X1),inverse(X0))) = X1,
inference(demodulation,[status(thm)],[c_431,c_1186]) ).
tcf(c_1266,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(divide(divide(X0,divide(X1,inverse(X0))),divide(X2,X1))) = X2,
inference(superposition,[status(thm)],[c_1219,c_1219]) ).
tcf(c_1294,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(X1,inverse(X0))),divide(inverse(X2),X1)) = X2,
inference(superposition,[status(thm)],[c_1219,c_1222]) ).
tcf(c_1527,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(divide(X1,X2),divide(X3,divide(divide(X2,X1),inverse(X3))))) = X0,
inference(superposition,[status(thm)],[c_1266,c_52]) ).
tcf(c_1852,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(inverse(divide(X0,divide(divide(X1,X2),divide(X3,divide(divide(X2,X1),inverse(X3))))))) = X0,
inference(superposition,[status(thm)],[c_1294,c_138]) ).
tcf(c_1857,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1852,c_1527]) ).
tcf(c_1859,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),divide(X1,X0)) = inverse(X1),
inference(demodulation,[status(thm)],[c_1204,c_1857]) ).
tcf(c_1915,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,inverse(X0))) = inverse(X1),
inference(superposition,[status(thm)],[c_1857,c_1222]) ).
tcf(c_1922,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(inverse(X0),X1)),X0) = X1,
inference(superposition,[status(thm)],[c_1857,c_1157]) ).
tcf(c_1951,plain,
! [X0: $i,X1: $i,X2: $i] : divide(inverse(inverse(X0)),divide(divide(X1,X2),inverse(divide(X2,X1)))) = X0,
inference(superposition,[status(thm)],[c_1859,c_52]) ).
tcf(c_1971,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X2),inverse(divide(X2,X1)))) = X0,
inference(light_normalisation,[status(thm)],[c_1951,c_1857]) ).
tcf(c_2398,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_1971,c_1915]) ).
tcf(c_2402,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X2),divide(X1,X2))) = X0,
inference(demodulation,[status(thm)],[c_1971,c_2398]) ).
tcf(c_2405,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(demodulation,[status(thm)],[c_1922,c_2398]) ).
tcf(c_2479,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_2402,c_2402]) ).
tcf(c_2487,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_2479,c_2398]) ).
tcf(c_2500,plain,
! [X0: $i,X1: $i] : divide(inverse(inverse(X0)),X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_2487,c_2405]) ).
tcf(c_2511,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(light_normalisation,[status(thm)],[c_2500,c_1857]) ).
tcf(c_2514,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_2511]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP469-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.09/0.37 % Computer : n007.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Wed Sep 23 14:48:52 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running UEQ theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.77/1.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.77/1.19 % SZS status Started for theBenchmark.p
% 3.77/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.77/1.19
% 3.77/1.19 % ------ iProver source info
% 3.77/1.19
% 3.77/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.77/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.77/1.19 % git: non_committed_changes: false
% 3.77/1.19
% 3.77/1.19 % ------ Parsing...% successful
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.77/1.19
% 3.77/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.77/1.19 % ------ Proving...
% 3.77/1.19 % ------ Problem Properties
% 3.77/1.19
% 3.77/1.19 %
% 3.77/1.19 % clauses 2
% 3.77/1.19 % conjectures 1
% 3.77/1.19 % EPR 0
% 3.77/1.19 % Horn 2
% 3.77/1.19 % unary 2
% 3.77/1.19 % binary 0
% 3.77/1.19 % lits 2
% 3.77/1.19 % lits eq 2
% 3.77/1.19 % fd_pure 0
% 3.77/1.19 % fd_pseudo 0
% 3.77/1.19 % fd_cond 0
% 3.77/1.19 % fd_pseudo_cond 0
% 3.77/1.19 % AC symbols 0
% 3.77/1.19
% 3.77/1.19 % ------ Input Options Time Limit: Unbounded
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 % ------
% 3.77/1.19 % Current options:
% 3.77/1.19 % ------
% 3.77/1.19
% 3.77/1.19
% 3.77/1.19 %
% 3.77/1.19
% 3.77/1.19 % ------ Proving...
% 3.77/1.19 %
% 3.77/1.19
% 3.77/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.19
% 3.77/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.19
% 3.77/1.19
%------------------------------------------------------------------------------