%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP612-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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:51 PM UTC 2026
% Result : Unsatisfiable 2.39s 6.22s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 69 ( 0 sgn 69 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,X1)),X2)),double_divide(X0,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/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] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,X1)),X2)),double_divide(X0,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] : inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(inverse(double_divide(inverse(double_divide(X2,X0)),X3)),X1))) = double_divide(X2,X3),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),double_divide(X1,X2)))) = X2,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(double_divide(X0,X1),double_divide(X2,double_divide(inverse(double_divide(inverse(double_divide(X0,X2)),X1)),X3)))) = X3,
inference(superposition,[status(thm)],[c_52,c_95]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X2,X1))) = double_divide(inverse(double_divide(X3,X2)),double_divide(X3,X0)),
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,X1)),double_divide(X0,inverse(double_divide(X1,X2)))) = X2,
inference(superposition,[status(thm)],[c_100,c_52]) ).
tcf(c_334,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(X0),double_divide(X1,double_divide(X1,inverse(double_divide(X2,X0)))))) = X2,
inference(superposition,[status(thm)],[c_173,c_52]) ).
tcf(c_344,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : double_divide(inverse(double_divide(X0,X1)),inverse(double_divide(X2,X3))) = inverse(double_divide(double_divide(X0,X2),double_divide(X1,X3))),
inference(superposition,[status(thm)],[c_173,c_98]) ).
tcf(c_631,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(X0,inverse(double_divide(X1,double_divide(inverse(double_divide(X0,X1)),X2)))) = X2,
inference(superposition,[status(thm)],[c_93,c_95]) ).
tcf(c_1193,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,inverse(X1))),inverse(double_divide(X2,X1))) = double_divide(X0,X2),
inference(superposition,[status(thm)],[c_334,c_631]) ).
tcf(c_1562,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(double_divide(X0,X1),double_divide(inverse(X2),X2))) = double_divide(X0,X1),
inference(demodulation,[status(thm)],[c_1193,c_344]) ).
tcf(c_1565,plain,
! [X0: $i,X1: $i] : inverse(double_divide(X0,double_divide(inverse(X1),X1))) = X0,
inference(superposition,[status(thm)],[c_173,c_1562]) ).
tcf(c_1631,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),X2))) = double_divide(X1,X2),
inference(superposition,[status(thm)],[c_1565,c_93]) ).
tcf(c_1644,plain,
! [X0: $i,X1: $i] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_631,c_1631]) ).
tcf(c_1765,plain,
! [X0: $i,X1: $i,X2: $i] : double_divide(inverse(double_divide(X0,X1)),X2) = double_divide(X0,inverse(double_divide(X1,X2))),
inference(superposition,[status(thm)],[c_173,c_1644]) ).
tcf(c_1771,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(double_divide(inverse(X0),X1)),double_divide(X2,X1))) = double_divide(X2,X0),
inference(superposition,[status(thm)],[c_1644,c_52]) ).
tcf(c_1786,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,double_divide(X0,X1))),X1)),X2)) = X2,
inference(superposition,[status(thm)],[c_1644,c_98]) ).
tcf(c_1794,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(double_divide(inverse(X0),X0)),X1)) = X1,
inference(light_normalisation,[status(thm)],[c_1786,c_1644]) ).
tcf(c_2172,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(double_divide(inverse(X0),inverse(double_divide(X1,double_divide(X2,X1))))) = double_divide(X2,X0),
inference(demodulation,[status(thm)],[c_1771,c_1765]) ).
tcf(c_2178,plain,
! [X0: $i,X1: $i] : inverse(double_divide(inverse(X0),inverse(X1))) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1644,c_2172]) ).
tcf(c_2342,plain,
! [X0: $i,X1: $i] : double_divide(double_divide(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_1794,c_1765,c_2178]) ).
tcf(c_2345,plain,
! [X0: $i,X1: $i] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[status(thm)],[c_1644,c_2342]) ).
tcf(c_2360,plain,
inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
inference(demodulation,[status(thm)],[c_53,c_2345]) ).
tcf(c_2364,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP612-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.39 % Computer : n013.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Wed Sep 23 15:12:29 UTC 2026
% 0.14/5.40 % CPUTime :
% 0.14/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.43 Running UEQ theorem proving
% 0.14/5.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/5.44
% 0.14/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.44
% 0.14/5.45 % Detected problem language: tptp
% 0.14/5.46 % Proving...
% 2.39/6.22 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.39/6.22 % SZS status Started for theBenchmark.p
% 2.39/6.22 % SZS status Unsatisfiable for theBenchmark.p
% 2.39/6.22
% 2.39/6.22 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.39/6.22
% 2.39/6.22 % ------ iProver source info
% 2.39/6.22
% 2.39/6.22 % git: date: 2026-07-19 20:42:38 +0200
% 2.39/6.22 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.39/6.22 % git: non_committed_changes: false
% 2.39/6.22
% 2.39/6.22 % ------ Parsing...% successful
% 2.39/6.22
% 2.39/6.22
% 2.39/6.22 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.39/6.22
% 2.39/6.22 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.39/6.22
% 2.39/6.22 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.39/6.22
% 2.39/6.22 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.39/6.22 % ------ Proving...
% 2.39/6.22 % ------ Problem Properties
% 2.39/6.22
% 2.39/6.22 %
% 2.39/6.22 % clauses 2
% 2.39/6.22 % conjectures 1
% 2.39/6.22 % EPR 0
% 2.39/6.22 % Horn 2
% 2.39/6.22 % unary 2
% 2.39/6.22 % binary 0
% 2.39/6.22 % lits 2
% 2.39/6.22 % lits eq 2
% 2.39/6.22 % fd_pure 0
% 2.39/6.22 % fd_pseudo 0
% 2.39/6.22 % fd_cond 0
% 2.39/6.22 % fd_pseudo_cond 0
% 2.39/6.22 % AC symbols 0
% 2.39/6.22
% 2.39/6.22 % ------ Input Options Time Limit: Unbounded
% 2.39/6.22
% 2.39/6.22
% 2.39/6.22 % ------
% 2.39/6.22 % Current options:
% 2.39/6.22 % ------
% 2.39/6.22
% 2.39/6.22
% 2.39/6.22 %
% 2.39/6.22
% 2.39/6.22 % ------ Proving...
% 2.39/6.22 %
% 2.39/6.22
% 2.39/6.22 % SZS status Unsatisfiable for theBenchmark.p
% 2.39/6.22
% 2.39/6.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.39/6.22
% 2.39/6.22
%------------------------------------------------------------------------------