%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP070-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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:30:39 PM UTC 2026
% Result : Unsatisfiable 4.26s 1.21s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 21 unt; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 17 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 59 !; 0 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1] : divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2,
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,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
fof(f4,plain,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| a2 != multiply(multiply(inverse(b2),b2),a2)
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(reorient_equations,[],[f3]) ).
fof(f5,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| a2 != divide(divide(inverse(b2),inverse(b2)),inverse(a2))
| divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)) ),
inference(definition_unfolding,[],[f4,f2,f2,f2,f2,f2,f2,f2,f2]) ).
tcf(c_52,negated_conjecture,
( ( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)) )
| ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) )
| ( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X1)),inverse(X3)))) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : divide(divide(X0,X0),divide(divide(divide(X1,divide(X2,X3)),inverse(X2)),divide(X1,inverse(X3)))) = divide(X4,X4),
inference(superposition,[status(thm)],[c_53,c_53]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_109,c_109]) ).
tcf(c_135,plain,
( ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) )
| ( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_126]) ).
tcf(c_212,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X0),divide(X1,divide(divide(X2,divide(X3,X3)),inverse(X1)))) = X2,
inference(superposition,[status(thm)],[c_126,c_53]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X0),divide(X1,divide(divide(X2,X2),inverse(X3)))) = divide(X3,X1),
inference(superposition,[status(thm)],[c_126,c_53]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),inverse(X0))) = divide(X2,X2),
inference(superposition,[status(thm)],[c_213,c_126]) ).
tcf(c_343,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X0),divide(inverse(X1),divide(divide(X2,X2),inverse(divide(X3,X3))))) = X1,
inference(superposition,[status(thm)],[c_286,c_53]) ).
tcf(c_558,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(demodulation,[status(thm)],[c_343,c_213]) ).
tcf(c_560,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X0),divide(X1,X2)) = divide(X2,X1),
inference(demodulation,[status(thm)],[c_213,c_558]) ).
tcf(c_561,plain,
( ( a2 != a2 )
| ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ) ),
inference(demodulation,[status(thm)],[c_135,c_558]) ).
tcf(c_562,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(equality_resolution_simp,[status(thm)],[c_561]) ).
tcf(c_563,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,divide(X1,X2)),inverse(X1)),X2) = X0,
inference(demodulation,[status(thm)],[c_53,c_560]) ).
tcf(c_564,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,divide(X1,X1)),inverse(X2)),X2) = X0,
inference(demodulation,[status(thm)],[c_212,c_560]) ).
tcf(c_593,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(X0,X0),divide(X1,X2)) = divide(divide(X2,X1),divide(X3,X3)),
inference(superposition,[status(thm)],[c_560,c_560]) ).
tcf(c_594,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X2,X2)) = divide(X0,X1),
inference(light_normalisation,[status(thm)],[c_593,c_560]) ).
tcf(c_660,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_563,c_594]) ).
tcf(c_681,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(demodulation,[status(thm)],[c_564,c_660]) ).
tcf(c_718,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_681,c_560]) ).
tcf(c_719,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(X0,inverse(divide(X1,X2))),
inference(superposition,[status(thm)],[c_681,c_563]) ).
tcf(c_767,plain,
$false,
inference(ground_joinability,[status(thm)],[c_562,c_718,c_719]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP070-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n002.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 13:29:53 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 4.26/1.21 % SZS status Started for theBenchmark.p
% 4.26/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.26/1.21
% 4.26/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.26/1.21
% 4.26/1.21 % ------ iProver source info
% 4.26/1.21
% 4.26/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 4.26/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.26/1.21 % git: non_committed_changes: false
% 4.26/1.21
% 4.26/1.21 % ------ Parsing...% successful
% 4.26/1.21
% 4.26/1.21
% 4.26/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.26/1.21
% 4.26/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.26/1.21
% 4.26/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.26/1.21
% 4.26/1.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.26/1.21 % ------ Proving...
% 4.26/1.21 % ------ Problem Properties
% 4.26/1.21
% 4.26/1.21 %
% 4.26/1.21 % clauses 2
% 4.26/1.21 % conjectures 1
% 4.26/1.21 % EPR 0
% 4.26/1.21 % Horn 2
% 4.26/1.21 % unary 1
% 4.26/1.21 % binary 0
% 4.26/1.21 % lits 4
% 4.26/1.21 % lits eq 4
% 4.26/1.21 % fd_pure 0
% 4.26/1.21 % fd_pseudo 0
% 4.26/1.21 % fd_cond 0
% 4.26/1.21 % fd_pseudo_cond 0
% 4.26/1.21 % AC symbols 0
% 4.26/1.21
% 4.26/1.21 % ------ Schedule dynamic 5 is on
% 4.26/1.21
% 4.26/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.26/1.21
% 4.26/1.21
% 4.26/1.21 % ------
% 4.26/1.21 % Current options:
% 4.26/1.21 % ------
% 4.26/1.21
% 4.26/1.21
% 4.26/1.21 %
% 4.26/1.21
% 4.26/1.21 % ------ Proving...
% 4.26/1.21 %
% 4.26/1.21
% 4.26/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 4.26/1.21
% 4.26/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.26/1.21
% 4.26/1.21
%------------------------------------------------------------------------------