%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP608-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 : n003.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:50 PM UTC 2026
% Result : Unsatisfiable 1.15s 1.18s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% 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 : 71 ( 0 sgn 71 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),X2) = X1,
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(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),X2) = X1,
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(inverse(double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),inverse(double_divide(inverse(X3),X1)))),X2) = X3,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,double_divide(X2,X3))))) = double_divide(inverse(double_divide(X2,inverse(X1))),X3),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(X0),double_divide(inverse(double_divide(X1,inverse(X0))),double_divide(X1,inverse(X2)))) = X2,
inference(superposition,[status(thm)],[c_103,c_103]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(X0),double_divide(X1,double_divide(X1,inverse(X2))))),X0) = X2,
inference(superposition,[status(thm)],[c_52,c_124]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(X0,X1)),double_divide(X2,double_divide(X2,inverse(X3)))) = double_divide(inverse(double_divide(X0,inverse(X3))),X1),
inference(superposition,[status(thm)],[c_144,c_52]) ).
tcf(c_287,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(X0,inverse(double_divide(X1,X2)))),inverse(X3)) = double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X3))),X2))),
inference(superposition,[status(thm)],[c_194,c_95]) ).
tcf(c_348,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),inverse(double_divide(inverse(X1),X0))) = X1,
inference(demodulation,[status(thm)],[c_93,c_52,c_287]) ).
tcf(c_349,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2)))) = double_divide(inverse(X2),inverse(X1)),
inference(superposition,[status(thm)],[c_52,c_348]) ).
tcf(c_367,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X0) = X1,
inference(demodulation,[status(thm)],[c_52,c_349]) ).
tcf(c_454,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[status(thm)],[c_367,c_103]) ).
tcf(c_484,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X2) = double_divide(inverse(X1),double_divide(inverse(X2),X0)),
inference(superposition,[status(thm)],[c_349,c_367]) ).
tcf(c_713,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_454,c_348]) ).
tcf(c_805,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X0),X0)),inverse(X1))),inverse(X2))),X2) = X1,
inference(superposition,[status(thm)],[c_713,c_103]) ).
tcf(c_817,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X1) = X0,
inference(light_normalisation,[status(thm)],[c_805,c_713]) ).
tcf(c_963,plain,
! [X0: $i,X1: $i] : double_divide(inverse(X0),double_divide(inverse(X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_817,c_484]) ).
tcf(c_967,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(X0),X1)) = double_divide(inverse(X1),X0),
inference(superposition,[status(thm)],[c_348,c_963]) ).
tcf(c_986,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(inverse(X0),X0),inverse(X1)) = X1,
inference(demodulation,[status(thm)],[c_713,c_967]) ).
tcf(c_1040,plain,
! [X0: $i,X1: $i] : double_divide(inverse(double_divide(inverse(X0),X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_963,c_967]) ).
tcf(c_1050,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(inverse(X0),X1),X1) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_1040,c_967]) ).
tcf(c_1082,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_1050,c_986]) ).
tcf(c_1099,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_1082,c_1050]) ).
tcf(c_1101,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_1082,c_963]) ).
tcf(c_1111,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,X1),X0) = X1,
inference(superposition,[status(thm)],[c_1099,c_1101]) ).
tcf(c_1326,plain,
! [X0: $i,X1: $i] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1111,c_1099]) ).
tcf(c_1330,plain,
inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
inference(demodulation,[status(thm)],[c_53,c_1326]) ).
tcf(c_1331,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1330]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP608-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.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 15:14:04 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running UEQ theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.15/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.15/1.18 % SZS status Started for theBenchmark.p
% 1.15/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.15/1.18
% 1.15/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/1.18
% 1.15/1.18 % ------ iProver source info
% 1.15/1.18
% 1.15/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.15/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/1.18 % git: non_committed_changes: false
% 1.15/1.18
% 1.15/1.18 % ------ Parsing...% successful
% 1.15/1.18
% 1.15/1.18
% 1.15/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.15/1.18
% 1.15/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.15/1.18
% 1.15/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.15/1.18
% 1.15/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.15/1.18 % ------ Proving...
% 1.15/1.18 % ------ Problem Properties
% 1.15/1.18
% 1.15/1.18 %
% 1.15/1.18 % clauses 2
% 1.15/1.18 % conjectures 1
% 1.15/1.18 % EPR 0
% 1.15/1.18 % Horn 2
% 1.15/1.18 % unary 2
% 1.15/1.18 % binary 0
% 1.15/1.18 % lits 2
% 1.15/1.18 % lits eq 2
% 1.15/1.18 % fd_pure 0
% 1.15/1.18 % fd_pseudo 0
% 1.15/1.18 % fd_cond 0
% 1.15/1.18 % fd_pseudo_cond 0
% 1.15/1.18 % AC symbols 0
% 1.15/1.18
% 1.15/1.18 % ------ Input Options Time Limit: Unbounded
% 1.15/1.18
% 1.15/1.18
% 1.15/1.18 % ------
% 1.15/1.18 % Current options:
% 1.15/1.18 % ------
% 1.15/1.18
% 1.15/1.18
% 1.15/1.18 %
% 1.15/1.18
% 1.15/1.18 % ------ Proving...
% 1.15/1.18 %
% 1.15/1.18
% 1.15/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.15/1.18
% 1.15/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/1.18
% 1.15/1.18
%------------------------------------------------------------------------------