%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP474-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 : 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:20 PM UTC 2026
% Result : Unsatisfiable 7.70s 1.75s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 37 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 10 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 125 !; 0 ?; 119 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : divide(divide(inverse(divide(X0,X1)),divide(divide(X2,X3),X0)),divide(X3,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,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(definition_unfolding,[],[f3,f2,f2,f2,f2]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(inverse(divide(X0,X1)),divide(divide(X2,X3),X0)),divide(X3,X2)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(inverse(X0),divide(divide(X1,X2),divide(inverse(divide(X3,X0)),divide(divide(X4,X5),X3)))),divide(X2,X1)) = divide(X5,X4),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(X0,X1),X2)),X3),divide(divide(divide(X1,X0),X4),inverse(divide(X4,X3)))) = X2,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_176,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i,X9: $i] : divide(divide(inverse(X0),divide(divide(X1,X2),divide(inverse(divide(X3,X0)),divide(divide(X4,X5),X3)))),divide(X2,X1)) = divide(divide(X6,X7),divide(inverse(X8),divide(divide(X7,X6),divide(inverse(divide(X9,X8)),divide(divide(X5,X4),X9))))),
inference(superposition,[status(thm)],[c_96,c_96]) ).
tcf(c_186,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(X0,X1),divide(inverse(X2),divide(divide(X1,X0),divide(inverse(divide(X3,X2)),divide(divide(X4,X5),X3))))) = divide(X4,X5),
inference(light_normalisation,[status(thm)],[c_176,c_96]) ).
tcf(c_897,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(X0,X1),divide(inverse(X2),divide(divide(X1,X0),divide(inverse(divide(X3,X2)),divide(X4,X3))))) = X4,
inference(superposition,[status(thm)],[c_98,c_186]) ).
tcf(c_988,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(inverse(divide(divide(inverse(X0),divide(divide(X1,X2),divide(inverse(divide(X3,X0)),divide(X4,X3)))),X5)),X4),divide(X1,X2)) = X5,
inference(superposition,[status(thm)],[c_897,c_52]) ).
tcf(c_2289,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(inverse(X0),divide(X1,divide(inverse(divide(X2,X0)),divide(X3,X2)))),X4)),X3),X1) = X4,
inference(superposition,[status(thm)],[c_988,c_988]) ).
tcf(c_2687,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(inverse(divide(X0,X1)),divide(X1,X0)),divide(X2,X3)) = divide(X3,X2),
inference(superposition,[status(thm)],[c_96,c_2289]) ).
tcf(c_3255,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(inverse(divide(X0,X1)),divide(X1,X0)),divide(X2,X3)) = divide(divide(X3,X2),divide(inverse(divide(X4,X5)),divide(X5,X4))),
inference(superposition,[status(thm)],[c_2687,c_2687]) ).
tcf(c_3260,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(X0,X1),X2)),divide(X1,X0)),divide(divide(X3,X4),inverse(divide(X4,X3)))) = X2,
inference(superposition,[status(thm)],[c_2687,c_52]) ).
tcf(c_3284,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(divide(X0,divide(X1,divide(X2,X3)))),divide(divide(X3,X2),X0)) = X1,
inference(superposition,[status(thm)],[c_2687,c_98]) ).
tcf(c_3309,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X1),divide(inverse(divide(X2,X3)),divide(X3,X2))) = divide(X0,X1),
inference(light_normalisation,[status(thm)],[c_3255,c_2687]) ).
tcf(c_4662,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(divide(X1,X2)),divide(X2,X1))) = X0,
inference(superposition,[status(thm)],[c_2289,c_3309]) ).
tcf(c_4851,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(inverse(divide(divide(inverse(X0),X1),X2)),X0),X1) = X2,
inference(superposition,[status(thm)],[c_4662,c_2289]) ).
tcf(c_4857,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(inverse(X2),divide(X1,X0))) = X2,
inference(superposition,[status(thm)],[c_4662,c_897]) ).
tcf(c_5474,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,divide(X1,X2)),X3) = divide(X0,divide(X3,divide(X2,X1))),
inference(superposition,[status(thm)],[c_3284,c_4857]) ).
tcf(c_5518,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(X0),X1),divide(divide(divide(X2,X3),X4),inverse(divide(X4,X1)))) = divide(inverse(X0),divide(X2,X3)),
inference(superposition,[status(thm)],[c_4857,c_98]) ).
tcf(c_5559,plain,
! [X0: $i,X1: $i,X2: $i] : divide(inverse(divide(divide(X0,X1),X2)),divide(X1,X0)) = X2,
inference(demodulation,[status(thm)],[c_98,c_5518]) ).
tcf(c_6300,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(divide(X0,X1)),divide(divide(X2,X3),X0)) = inverse(divide(divide(X2,X3),X1)),
inference(superposition,[status(thm)],[c_5559,c_3284]) ).
tcf(c_6304,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(divide(divide(X0,X1),divide(X2,divide(X1,X0)))) = X2,
inference(demodulation,[status(thm)],[c_3284,c_6300]) ).
tcf(c_6686,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,inverse(X2))) = divide(divide(X0,X2),X1),
inference(superposition,[status(thm)],[c_6304,c_4851]) ).
tcf(c_7130,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X2),inverse(divide(X2,X1)))) = X0,
inference(light_normalisation,[status(thm)],[c_3260,c_5559]) ).
tcf(c_7131,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X2),divide(X1,X2))) = X0,
inference(demodulation,[status(thm)],[c_7130,c_5474,c_6686]) ).
tcf(c_7152,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_7131,c_7131]) ).
tcf(c_7191,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_7152,c_4857]) ).
tcf(c_7194,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_7152,c_6304]) ).
tcf(c_7200,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(demodulation,[status(thm)],[c_53,c_7194]) ).
tcf(c_7269,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_7152,c_7194]) ).
tcf(c_7275,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_7191,c_7269]) ).
tcf(c_7324,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(X0,divide(X2,X1)),
inference(superposition,[status(thm)],[c_7275,c_6686]) ).
tcf(c_7326,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_7200,c_7324]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP474-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n013.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 14:50:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 7.70/1.75 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 7.70/1.75 % SZS status Started for theBenchmark.p
% 7.70/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 7.70/1.75
% 7.70/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.70/1.75
% 7.70/1.75 % ------ iProver source info
% 7.70/1.75
% 7.70/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 7.70/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.70/1.75 % git: non_committed_changes: false
% 7.70/1.75
% 7.70/1.75 % ------ Parsing...% successful
% 7.70/1.75
% 7.70/1.75
% 7.70/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.70/1.75
% 7.70/1.75 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 7.70/1.75
% 7.70/1.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.70/1.75
% 7.70/1.75 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.70/1.75 % ------ Proving...
% 7.70/1.75 % ------ Problem Properties
% 7.70/1.75
% 7.70/1.75 %
% 7.70/1.75 % clauses 2
% 7.70/1.75 % conjectures 1
% 7.70/1.75 % EPR 0
% 7.70/1.75 % Horn 2
% 7.70/1.75 % unary 2
% 7.70/1.75 % binary 0
% 7.70/1.75 % lits 2
% 7.70/1.75 % lits eq 2
% 7.70/1.75 % fd_pure 0
% 7.70/1.75 % fd_pseudo 0
% 7.70/1.75 % fd_cond 0
% 7.70/1.75 % fd_pseudo_cond 0
% 7.70/1.75 % AC symbols 0
% 7.70/1.75
% 7.70/1.75 % ------ Input Options Time Limit: Unbounded
% 7.70/1.75
% 7.70/1.75
% 7.70/1.75 % ------
% 7.70/1.75 % Current options:
% 7.70/1.75 % ------
% 7.70/1.75
% 7.70/1.75
% 7.70/1.75 %
% 7.70/1.75
% 7.70/1.75 % ------ Proving...
% 7.70/1.75 %
% 7.70/1.75
% 7.70/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 7.70/1.75
% 7.70/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.70/1.75
% 7.70/1.75
%------------------------------------------------------------------------------