%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP588-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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.79s 1.29s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 73 ( 0 sgn 73 !; 0 ?; 68 :)
% 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(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f4,plain,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
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(a,b)) != inverse(double_divide(b,a)),
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_202,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_351,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_515,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_351]) ).
tcf(c_525,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_351,c_52]) ).
tcf(c_530,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_351,c_157]) ).
tcf(c_534,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_351,c_202]) ).
tcf(c_536,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(double_divide(inverse(X1),inverse(X0)))) = X1,
inference(demodulation,[status(thm)],[c_52,c_515]) ).
tcf(c_628,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,inverse(X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_536,c_104]) ).
tcf(c_717,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_525,c_534]) ).
tcf(c_737,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_717,c_717]) ).
tcf(c_738,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,inverse(X1)),inverse(X1)) = X0,
inference(light_normalisation,[status(thm)],[c_737,c_530]) ).
tcf(c_832,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,inverse(X1))) = double_divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_351,c_738]) ).
tcf(c_833,plain,
! [X0: $i,X1: $i] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[status(thm)],[c_628,c_738]) ).
tcf(c_837,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),inverse(double_divide(X0,inverse(X1)))) = X1,
inference(superposition,[status(thm)],[c_738,c_351]) ).
tcf(c_932,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(X1,inverse(X0))) = X1,
inference(light_normalisation,[status(thm)],[c_837,c_832]) ).
tcf(c_936,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),X1) = double_divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_738,c_932]) ).
tcf(c_937,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(X1,inverse(X1))) = X0,
inference(superposition,[status(thm)],[c_833,c_932]) ).
tcf(c_960,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(inverse(X0),X1)) = X1,
inference(superposition,[status(thm)],[c_936,c_932]) ).
tcf(c_982,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_960,c_937]) ).
tcf(c_1002,plain,
! [X0: $i,X1: $i] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_982,c_936]) ).
tcf(c_1012,plain,
inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
inference(demodulation,[status(thm)],[c_53,c_1002]) ).
tcf(c_1013,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1012]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP588-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n006.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 15:09:12 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.79/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.79/1.29 % SZS status Started for theBenchmark.p
% 3.79/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.29
% 3.79/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.79/1.29
% 3.79/1.29 % ------ iProver source info
% 3.79/1.29
% 3.79/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.79/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.79/1.29 % git: non_committed_changes: false
% 3.79/1.29
% 3.79/1.29 % ------ Parsing...% successful
% 3.79/1.29
% 3.79/1.29
% 3.79/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.79/1.29
% 3.79/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.79/1.29
% 3.79/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.79/1.29
% 3.79/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.79/1.29 % ------ Proving...
% 3.79/1.29 % ------ Problem Properties
% 3.79/1.29
% 3.79/1.29 %
% 3.79/1.29 % clauses 2
% 3.79/1.29 % conjectures 1
% 3.79/1.29 % EPR 0
% 3.79/1.29 % Horn 2
% 3.79/1.29 % unary 2
% 3.79/1.29 % binary 0
% 3.79/1.29 % lits 2
% 3.79/1.29 % lits eq 2
% 3.79/1.29 % fd_pure 0
% 3.79/1.29 % fd_pseudo 0
% 3.79/1.29 % fd_cond 0
% 3.79/1.29 % fd_pseudo_cond 0
% 3.79/1.29 % AC symbols 0
% 3.79/1.29
% 3.79/1.29 % ------ Input Options Time Limit: Unbounded
% 3.79/1.29
% 3.79/1.29
% 3.79/1.29 % ------
% 3.79/1.29 % Current options:
% 3.79/1.29 % ------
% 3.79/1.29
% 3.79/1.29
% 3.79/1.29 %
% 3.79/1.29
% 3.79/1.29 % ------ Proving...
% 3.79/1.29 %
% 3.79/1.29
% 3.79/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.79/1.29
% 3.79/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.79/1.29
% 3.79/1.29
%------------------------------------------------------------------------------