%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP561-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 : n012.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 0.59s 6.38s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 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 : 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 : 33 ( 0 sgn 33 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
file('/export/starexec/sandbox2/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(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f5,plain,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
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(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
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_135,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X0) = X1,
inference(demodulation,[status(thm)],[c_115,c_52]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_135,c_52]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_142,c_135]) ).
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_185,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_185]) ).
tcf(c_270,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),inverse(X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_135,c_224]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_185,c_224]) ).
tcf(c_288,plain,
divide(inverse(b1),inverse(b1)) != divide(a1,a1),
inference(demodulation,[status(thm)],[c_53,c_270]) ).
tcf(c_289,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_288,c_271]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP561-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/5.73 % Computer : n012.cluster.edu
% 0.03/5.73 % Model : x86_64 x86_64
% 0.03/5.73 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.73 % Memory : 8046.5625MB
% 0.03/5.73 % OS : Linux 6.8.0-71-generic
% 0.03/5.73 % CPULimit : 300
% 0.03/5.73 % WCLimit : 300
% 0.03/5.73 % DateTime : Wed Sep 23 15:05:12 UTC 2026
% 0.03/5.73 % CPUTime :
% 0.03/5.73 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/5.75 Running UEQ theorem proving
% 0.03/5.75 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.03/5.75
% 0.03/5.75 % ======== iProver multi-core TPTP/SMT =========
% 0.03/5.75
% 0.03/5.75 % Detected problem language: tptp
% 0.03/5.76 % Proving...
% 0.59/6.38 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.59/6.38 % SZS status Started for theBenchmark.p
% 0.59/6.38 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/6.38
% 0.59/6.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.59/6.38
% 0.59/6.38 % ------ iProver source info
% 0.59/6.38
% 0.59/6.38 % git: date: 2026-07-19 20:42:38 +0200
% 0.59/6.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.59/6.38 % git: non_committed_changes: false
% 0.59/6.38
% 0.59/6.38 % ------ Parsing...% successful
% 0.59/6.38
% 0.59/6.38
% 0.59/6.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.59/6.38
% 0.59/6.38 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.59/6.38
% 0.59/6.38 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.59/6.38
% 0.59/6.38 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.59/6.38 % ------ Proving...
% 0.59/6.38 % ------ Problem Properties
% 0.59/6.38
% 0.59/6.38 %
% 0.59/6.38 % clauses 2
% 0.59/6.38 % conjectures 1
% 0.59/6.38 % EPR 0
% 0.59/6.38 % Horn 2
% 0.59/6.38 % unary 2
% 0.59/6.38 % binary 0
% 0.59/6.38 % lits 2
% 0.59/6.38 % lits eq 2
% 0.59/6.38 % fd_pure 0
% 0.59/6.38 % fd_pseudo 0
% 0.59/6.38 % fd_cond 0
% 0.59/6.38 % fd_pseudo_cond 0
% 0.59/6.38 % AC symbols 0
% 0.59/6.38
% 0.59/6.38 % ------ Input Options Time Limit: Unbounded
% 0.59/6.38
% 0.59/6.38
% 0.59/6.38 % ------
% 0.59/6.38 % Current options:
% 0.59/6.38 % ------
% 0.59/6.38
% 0.59/6.38
% 0.59/6.38 %
% 0.59/6.38
% 0.59/6.38 % ------ Proving...
% 0.59/6.38 %
% 0.59/6.38
% 0.59/6.38 % SZS status Unsatisfiable for theBenchmark.p
% 0.59/6.38
% 0.59/6.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.59/6.38
% 0.59/6.38
%------------------------------------------------------------------------------