%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP594-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 : n005.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 2.94s 1.19s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 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 : 8 ( 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 : 44 ( 0 sgn 44 !; 0 ?; 39 :)
% 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(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f4,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f3]) ).
fof(f5,plain,
a2 != inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))),
inference(definition_unfolding,[],[f4,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(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(cnf_transformation,[],[f5]) ).
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_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_173,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_192,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_312,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_173]) ).
tcf(c_333,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_173,c_52]) ).
tcf(c_541,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_192]) ).
tcf(c_1878,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_312,c_541]) ).
tcf(c_1917,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),inverse(X0))) = X1,
inference(demodulation,[status(thm)],[c_333,c_1878]) ).
tcf(c_2013,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,inverse(double_divide(X1,X2)))) = inverse(double_divide(X1,inverse(double_divide(X0,X2)))),
inference(superposition,[status(thm)],[c_52,c_1917]) ).
tcf(c_2019,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_541,c_1917]) ).
tcf(c_2052,plain,
inverse(double_divide(b2,inverse(double_divide(a2,inverse(b2))))) != a2,
inference(demodulation,[status(thm)],[c_53,c_2013]) ).
tcf(c_2054,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(double_divide(X1,inverse(X0))))) = X1,
inference(demodulation,[status(thm)],[c_541,c_2019]) ).
tcf(c_2055,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2052,c_2054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP594-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.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 15:10:02 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running UEQ theorem proving
% 0.10/0.42 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 2.94/1.19 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.94/1.19 % SZS status Started for theBenchmark.p
% 2.94/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.94/1.19
% 2.94/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.94/1.19
% 2.94/1.19 % ------ iProver source info
% 2.94/1.19
% 2.94/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 2.94/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.94/1.19 % git: non_committed_changes: false
% 2.94/1.19
% 2.94/1.19 % ------ Parsing...% successful
% 2.94/1.19
% 2.94/1.19
% 2.94/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.94/1.19
% 2.94/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.94/1.19
% 2.94/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.94/1.19
% 2.94/1.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.94/1.19 % ------ Proving...
% 2.94/1.19 % ------ Problem Properties
% 2.94/1.19
% 2.94/1.19 %
% 2.94/1.19 % clauses 2
% 2.94/1.19 % conjectures 1
% 2.94/1.19 % EPR 0
% 2.94/1.19 % Horn 2
% 2.94/1.19 % unary 2
% 2.94/1.19 % binary 0
% 2.94/1.19 % lits 2
% 2.94/1.19 % lits eq 2
% 2.94/1.19 % fd_pure 0
% 2.94/1.19 % fd_pseudo 0
% 2.94/1.19 % fd_cond 0
% 2.94/1.19 % fd_pseudo_cond 0
% 2.94/1.19 % AC symbols 0
% 2.94/1.19
% 2.94/1.19 % ------ Input Options Time Limit: Unbounded
% 2.94/1.19
% 2.94/1.19
% 2.94/1.19 % ------
% 2.94/1.19 % Current options:
% 2.94/1.19 % ------
% 2.94/1.19
% 2.94/1.19
% 2.94/1.19 %
% 2.94/1.19
% 2.94/1.19 % ------ Proving...
% 2.94/1.19 %
% 2.94/1.19
% 2.94/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.94/1.19
% 2.94/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.94/1.19
% 2.94/1.19
%------------------------------------------------------------------------------