%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP478-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 : n020.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:22 PM UTC 2026
% Result : Unsatisfiable 6.97s 6.73s
% Output : CNFRefutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 92 ( 0 sgn 92 !; 0 ?; 86 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,X3)))),X3) = X2,
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(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(definition_unfolding,[],[f3,f2,f2]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,X3)))),X3) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(inverse(divide(divide(divide(X0,X0),inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4))))),divide(X5,X3))),X4) = X5,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : inverse(divide(divide(divide(X0,X0),X1),divide(X2,divide(X1,divide(X3,X4))))) = divide(inverse(divide(divide(divide(X5,X5),X3),X2)),X4),
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = X2,
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : inverse(divide(divide(divide(X0,X0),X1),divide(divide(X2,divide(X3,X4)),divide(X1,divide(X3,X4))))) = X2,
inference(superposition,[status(thm)],[c_95,c_52]) ).
tcf(c_234,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(X0,X1)),X2),divide(divide(X3,inverse(divide(divide(divide(X4,X4),X3),X0))),X2)) = X1,
inference(superposition,[status(thm)],[c_136,c_136]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : inverse(divide(divide(divide(X0,X0),X1),divide(divide(X2,X3),divide(X1,X3)))) = X2,
inference(superposition,[status(thm)],[c_93,c_145]) ).
tcf(c_329,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(divide(X0,X3),divide(X2,X3)),
inference(superposition,[status(thm)],[c_307,c_136]) ).
tcf(c_594,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(inverse(divide(divide(divide(X0,X0),X1),divide(X2,X1))),X3),divide(X4,X3)) = divide(X2,X4),
inference(superposition,[status(thm)],[c_329,c_136]) ).
tcf(c_1660,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(X0,divide(X1,inverse(divide(divide(divide(X2,X2),X1),divide(divide(X3,X3),X4))))) = divide(X0,X4),
inference(superposition,[status(thm)],[c_234,c_594]) ).
tcf(c_1917,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : divide(divide(inverse(divide(divide(divide(X0,X0),X1),X2)),X3),divide(X1,X3)) = divide(X4,inverse(divide(divide(divide(X5,X5),X4),divide(divide(X6,X6),X2)))),
inference(superposition,[status(thm)],[c_1660,c_136]) ).
tcf(c_1969,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,inverse(divide(divide(divide(X1,X1),X0),divide(divide(X2,X2),X3)))) = X3,
inference(light_normalisation,[status(thm)],[c_1917,c_136]) ).
tcf(c_2155,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X3),X2)))) = X0,
inference(superposition,[status(thm)],[c_329,c_1969]) ).
tcf(c_2421,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : divide(divide(X0,inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X3),X2)))),X4) = divide(divide(X0,X5),divide(X4,X5)),
inference(superposition,[status(thm)],[c_2155,c_329]) ).
tcf(c_2433,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(X0,X2),
inference(light_normalisation,[status(thm)],[c_2421,c_2155]) ).
tcf(c_2446,plain,
! [X0: $i,X1: $i,X2: $i] : inverse(divide(divide(divide(X0,X0),X1),divide(X2,X1))) = X2,
inference(demodulation,[status(thm)],[c_307,c_2433]) ).
tcf(c_2447,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(divide(X1,X1),divide(X2,X2)))) = X0,
inference(demodulation,[status(thm)],[c_2155,c_2433]) ).
tcf(c_2683,plain,
! [X0: $i,X1: $i] : inverse(divide(divide(X0,X0),X1)) = X1,
inference(demodulation,[status(thm)],[c_2446,c_2433]) ).
tcf(c_2714,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(demodulation,[status(thm)],[c_2447,c_2683]) ).
tcf(c_2732,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_2714,c_2683]) ).
tcf(c_2845,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_2732,c_2683]) ).
tcf(c_2906,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_2845]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP478-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.36 % Computer : n020.cluster.edu
% 0.10/5.36 % Model : x86_64 x86_64
% 0.10/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36 % Memory : 8046.5625MB
% 0.10/5.36 % OS : Linux 6.8.0-71-generic
% 0.10/5.36 % CPULimit : 300
% 0.10/5.36 % WCLimit : 300
% 0.10/5.36 % DateTime : Wed Sep 23 14:52:55 UTC 2026
% 0.10/5.36 % CPUTime :
% 0.10/5.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.40 Running UEQ theorem proving
% 0.13/5.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.13/5.41
% 0.13/5.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.41
% 0.13/5.41 % Detected problem language: tptp
% 0.13/5.42 % Proving...
% 6.97/6.73 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 6.97/6.73 % SZS status Started for theBenchmark.p
% 6.97/6.73 % SZS status Unsatisfiable for theBenchmark.p
% 6.97/6.73
% 6.97/6.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.97/6.73
% 6.97/6.73 % ------ iProver source info
% 6.97/6.73
% 6.97/6.73 % git: date: 2026-07-19 20:42:38 +0200
% 6.97/6.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.97/6.73 % git: non_committed_changes: false
% 6.97/6.73
% 6.97/6.73 % ------ Parsing...% successful
% 6.97/6.73
% 6.97/6.73
% 6.97/6.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.97/6.73
% 6.97/6.73 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 6.97/6.73
% 6.97/6.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.97/6.73
% 6.97/6.73 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 6.97/6.73 % ------ Proving...
% 6.97/6.73 % ------ Problem Properties
% 6.97/6.73
% 6.97/6.73 %
% 6.97/6.73 % clauses 2
% 6.97/6.73 % conjectures 1
% 6.97/6.73 % EPR 0
% 6.97/6.73 % Horn 2
% 6.97/6.73 % unary 2
% 6.97/6.73 % binary 0
% 6.97/6.74 % lits 2
% 6.97/6.74 % lits eq 2
% 6.97/6.74 % fd_pure 0
% 6.97/6.74 % fd_pseudo 0
% 6.97/6.74 % fd_cond 0
% 6.97/6.74 % fd_pseudo_cond 0
% 6.97/6.74 % AC symbols 0
% 6.97/6.74
% 6.97/6.74 % ------ Input Options Time Limit: Unbounded
% 6.97/6.74
% 6.97/6.74
% 6.97/6.74 % ------
% 6.97/6.74 % Current options:
% 6.97/6.74 % ------
% 6.97/6.74
% 6.97/6.74
% 6.97/6.74 %
% 6.97/6.74
% 6.97/6.74 % ------ Proving...
% 6.97/6.74 %
% 6.97/6.74
% 6.97/6.74 % SZS status Unsatisfiable for theBenchmark.p
% 6.97/6.74
% 6.97/6.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.97/6.74
% 6.97/6.74
%------------------------------------------------------------------------------