%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP564-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 : n001.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:44 PM UTC 2026
% Result : Unsatisfiable 3.28s 1.32s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 40 ( 0 sgn 40 !; 0 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,plain,
! [X0,X1] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(reorient_equations,[],[f2]) ).
fof(f4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f5,plain,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(definition_unfolding,[],[f4,f3,f3]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(divide(divide(divide(X0,inverse(X1)),X2),inverse(X3)),divide(X0,X2)),X1) = X3,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,divide(divide(divide(X1,inverse(inverse(X2))),X3),divide(X1,X3))),X0) = X2,
inference(superposition,[status(thm)],[c_95,c_95]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X0) = X1,
inference(demodulation,[status(thm)],[c_115,c_52]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_134,c_52]) ).
tcf(c_184,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_141,c_134]) ).
tcf(c_216,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(divide(X2,X2),X1)) = X0,
inference(superposition,[status(thm)],[c_184,c_52]) ).
tcf(c_220,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(divide(X0,X0),inverse(X1)),inverse(X2)),X2) = X1,
inference(superposition,[status(thm)],[c_184,c_52]) ).
tcf(c_224,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(light_normalisation,[status(thm)],[c_220,c_184]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_224,c_52]) ).
tcf(c_430,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_184,c_265]) ).
tcf(c_446,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),inverse(X1)) = X0,
inference(demodulation,[status(thm)],[c_216,c_430]) ).
tcf(c_451,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_134,c_446]) ).
tcf(c_471,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_451]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP564-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Wed Sep 23 15:11:05 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.42 Running UEQ theorem proving
% 0.13/0.42 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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 3.28/1.32 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.28/1.32 % SZS status Started for theBenchmark.p
% 3.28/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 3.28/1.32
% 3.28/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.28/1.32
% 3.28/1.32 % ------ iProver source info
% 3.28/1.32
% 3.28/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 3.28/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.28/1.32 % git: non_committed_changes: false
% 3.28/1.32
% 3.28/1.32 % ------ Parsing...% successful
% 3.28/1.32
% 3.28/1.32
% 3.28/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.28/1.32
% 3.28/1.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.28/1.32
% 3.28/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.28/1.32
% 3.28/1.32 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.28/1.32 % ------ Proving...
% 3.28/1.32 % ------ Problem Properties
% 3.28/1.32
% 3.28/1.32 %
% 3.28/1.32 % clauses 2
% 3.28/1.32 % conjectures 1
% 3.28/1.32 % EPR 0
% 3.28/1.32 % Horn 2
% 3.28/1.32 % unary 2
% 3.28/1.32 % binary 0
% 3.28/1.32 % lits 2
% 3.28/1.32 % lits eq 2
% 3.28/1.32 % fd_pure 0
% 3.28/1.32 % fd_pseudo 0
% 3.28/1.32 % fd_cond 0
% 3.28/1.32 % fd_pseudo_cond 0
% 3.28/1.32 % AC symbols 0
% 3.28/1.32
% 3.28/1.32 % ------ Input Options Time Limit: Unbounded
% 3.28/1.32
% 3.28/1.32
% 3.28/1.32 % ------
% 3.28/1.32 % Current options:
% 3.28/1.32 % ------
% 3.28/1.32
% 3.28/1.32
% 3.28/1.32 %
% 3.28/1.32
% 3.28/1.32 % ------ Proving...
% 3.28/1.32 %
% 3.28/1.32
% 3.28/1.32 % SZS status Unsatisfiable for theBenchmark.p
% 3.28/1.32
% 3.28/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.28/1.32
% 3.28/1.32
%------------------------------------------------------------------------------