%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP585-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 : n016.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:47 PM UTC 2026
% Result : Unsatisfiable 3.06s 1.31s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 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 : 60 ( 0 sgn 60 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(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] : double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X0,X1),inverse(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] : double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X2))),inverse(double_divide(inverse(double_divide(double_divide(X0,X3),inverse(X1))),X3))))) = X2,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(double_divide(double_divide(X0,X1),X2),inverse(X3))),X2) = double_divide(X0,inverse(double_divide(inverse(X3),X1))),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(inverse(X2),X1))))) = X2,
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(double_divide(inverse(X0),X1),inverse(double_divide(inverse(X2),X1))),inverse(X2)) = X0,
inference(superposition,[status(thm)],[c_104,c_104]) ).
tcf(c_157,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(X0,inverse(double_divide(double_divide(double_divide(inverse(X1),X2),X2),inverse(X0)))) = X1,
inference(superposition,[status(thm)],[c_52,c_123]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(double_divide(double_divide(inverse(X0),X1),X1),inverse(double_divide(X2,X3))) = double_divide(X2,inverse(double_divide(inverse(X0),X3))),
inference(superposition,[status(thm)],[c_157,c_52]) ).
tcf(c_353,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(X0,inverse(X1))),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_52,c_93]) ).
tcf(c_510,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(double_divide(X0,X1),inverse(X2))),X1) = double_divide(inverse(X2),inverse(X0)),
inference(superposition,[status(thm)],[c_52,c_353]) ).
tcf(c_520,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,inverse(X1))),inverse(double_divide(inverse(double_divide(X1,inverse(X2))),inverse(X0)))) = X2,
inference(superposition,[status(thm)],[c_353,c_52]) ).
tcf(c_525,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(X0,inverse(double_divide(double_divide(X1,inverse(X2)),inverse(X0)))) = double_divide(X2,inverse(X1)),
inference(superposition,[status(thm)],[c_353,c_157]) ).
tcf(c_529,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3))) = double_divide(double_divide(X2,inverse(X1)),inverse(double_divide(X0,X3))),
inference(superposition,[status(thm)],[c_353,c_203]) ).
tcf(c_531,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(double_divide(inverse(X1),inverse(X0)))) = X1,
inference(demodulation,[status(thm)],[c_52,c_510]) ).
tcf(c_603,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,inverse(X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_531,c_104]) ).
tcf(c_722,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,inverse(X1)),inverse(double_divide(double_divide(X2,inverse(X0)),inverse(X1)))) = X2,
inference(demodulation,[status(thm)],[c_520,c_529]) ).
tcf(c_742,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(double_divide(X0,inverse(double_divide(double_divide(X1,inverse(X2)),inverse(X0)))),inverse(X1)) = X2,
inference(superposition,[status(thm)],[c_722,c_722]) ).
tcf(c_743,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,inverse(X1)),inverse(X1)) = X0,
inference(light_normalisation,[status(thm)],[c_742,c_525]) ).
tcf(c_844,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(X1))) = double_divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_353,c_743]) ).
tcf(c_845,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_603,c_743]) ).
tcf(c_855,plain,
inverse(double_divide(b1,inverse(b1))) != double_divide(a1,inverse(a1)),
inference(demodulation,[status(thm)],[c_53,c_844]) ).
tcf(c_912,plain,
double_divide(a1,inverse(a1)) != double_divide(b1,inverse(b1)),
inference(demodulation,[status(thm)],[c_855,c_844]) ).
tcf(c_913,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_912,c_845]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP585-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.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 15:13:41 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running UEQ theorem proving
% 0.12/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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 3.06/1.31 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.06/1.31 % SZS status Started for theBenchmark.p
% 3.06/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 3.06/1.31
% 3.06/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.06/1.31
% 3.06/1.31 % ------ iProver source info
% 3.06/1.31
% 3.06/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.06/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.06/1.31 % git: non_committed_changes: false
% 3.06/1.31
% 3.06/1.31 % ------ Parsing...% successful
% 3.06/1.31
% 3.06/1.31
% 3.06/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.06/1.31
% 3.06/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.06/1.31
% 3.06/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.06/1.31
% 3.06/1.31 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.06/1.31 % ------ Proving...
% 3.06/1.31 % ------ Problem Properties
% 3.06/1.31
% 3.06/1.31 %
% 3.06/1.31 % clauses 2
% 3.06/1.31 % conjectures 1
% 3.06/1.31 % EPR 0
% 3.06/1.31 % Horn 2
% 3.06/1.31 % unary 2
% 3.06/1.31 % binary 0
% 3.06/1.31 % lits 2
% 3.06/1.31 % lits eq 2
% 3.06/1.31 % fd_pure 0
% 3.06/1.31 % fd_pseudo 0
% 3.06/1.31 % fd_cond 0
% 3.06/1.31 % fd_pseudo_cond 0
% 3.06/1.31 % AC symbols 0
% 3.06/1.31
% 3.06/1.31 % ------ Input Options Time Limit: Unbounded
% 3.06/1.31
% 3.06/1.31
% 3.06/1.31 % ------
% 3.06/1.31 % Current options:
% 3.06/1.31 % ------
% 3.06/1.31
% 3.06/1.31
% 3.06/1.31 %
% 3.06/1.31
% 3.06/1.31 % ------ Proving...
% 3.06/1.31 %
% 3.06/1.31
% 3.06/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 3.06/1.31
% 3.06/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.06/1.31
% 3.06/1.31
%------------------------------------------------------------------------------