%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP098-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 : n019.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:43 PM UTC 2026
% Result : Unsatisfiable 3.62s 1.20s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 41 ( 34 unt; 0 def)
% Number of atoms : 58 ( 57 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 29 ~; 17 |; 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 : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 71 !; 0 ?; 64 :)
% 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(a4,b4) != multiply(b4,a4)
| 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(f5,plain,
( multiply(a4,b4) != multiply(b4,a4)
| 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,[],[f4]) ).
fof(f6,plain,
( divide(a4,inverse(b4)) != divide(b4,inverse(a4))
| 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,[],[f5,f3,f3,f3,f3,f3,f3,f3,f3,f3,f3]) ).
tcf(c_52,negated_conjecture,
( ( divide(a4,inverse(b4)) != divide(b4,inverse(a4)) )
| ( 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,[],[f6]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_115,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_53,c_53]) ).
tcf(c_135,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_115,c_115]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X0) = X1,
inference(demodulation,[status(thm)],[c_135,c_53]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_165,c_53]) ).
tcf(c_218,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_172,c_165]) ).
tcf(c_221,plain,
( ( divide(a4,inverse(b4)) != divide(b4,inverse(a4)) )
| ( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)) )
| ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_218]) ).
tcf(c_240,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(divide(X2,X2),X1)) = X0,
inference(superposition,[status(thm)],[c_218,c_53]) ).
tcf(c_244,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(divide(X0,X0),inverse(X1)),inverse(X2)),X2) = X1,
inference(superposition,[status(thm)],[c_218,c_53]) ).
tcf(c_248,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(light_normalisation,[status(thm)],[c_244,c_218]) ).
tcf(c_350,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,divide(divide(X1,X1),divide(X2,X3))) = divide(divide(X2,inverse(X0)),X3),
inference(superposition,[status(thm)],[c_53,c_240]) ).
tcf(c_354,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),X2)) = divide(X2,inverse(X0)),
inference(superposition,[status(thm)],[c_165,c_240]) ).
tcf(c_385,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(demodulation,[status(thm)],[c_240,c_354]) ).
tcf(c_572,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),inverse(X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_165,c_248]) ).
tcf(c_574,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_218,c_248]) ).
tcf(c_582,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_248,c_53]) ).
tcf(c_600,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_248,c_218]) ).
tcf(c_602,plain,
( ( divide(a4,inverse(b4)) != divide(b4,inverse(a4)) )
| ( divide(inverse(b1),inverse(b1)) != divide(a1,a1) )
| ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ) ),
inference(demodulation,[status(thm)],[c_221,c_572]) ).
tcf(c_603,plain,
( ( divide(a4,inverse(b4)) != divide(b4,inverse(a4)) )
| ( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_602,c_574]) ).
tcf(c_687,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_600,c_165]) ).
tcf(c_750,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_248,c_385]) ).
tcf(c_754,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_385,c_582]) ).
tcf(c_756,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(backward_subsumption_resolution,[status(thm)],[c_603,c_750]) ).
tcf(c_761,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(b3),a3)),
inference(demodulation,[status(thm)],[c_756,c_750,c_754]) ).
tcf(c_790,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),X1) = divide(inverse(X1),X0),
inference(superposition,[status(thm)],[c_687,c_248]) ).
tcf(c_795,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_761,c_790]) ).
tcf(c_805,plain,
divide(a3,divide(inverse(b3),c3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_795,c_790]) ).
tcf(c_1050,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(divide(X0,X2),inverse(X1)),
inference(demodulation,[status(thm)],[c_350,c_354]) ).
tcf(c_1072,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),X2) = divide(divide(X0,X2),X1),
inference(superposition,[status(thm)],[c_600,c_1050]) ).
tcf(c_2034,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X0,X2)) = divide(X2,X1),
inference(superposition,[status(thm)],[c_582,c_1072]) ).
tcf(c_2134,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
inference(superposition,[status(thm)],[c_582,c_2034]) ).
tcf(c_2187,plain,
divide(a3,divide(inverse(b3),c3)) != divide(b3,divide(inverse(a3),c3)),
inference(demodulation,[status(thm)],[c_805,c_2134]) ).
tcf(c_2589,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = divide(X1,divide(inverse(X2),X0)),
inference(superposition,[status(thm)],[c_790,c_2134]) ).
tcf(c_2810,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2187,c_790,c_2589]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP098-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 13:31:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 3.62/1.20 % SZS status Started for theBenchmark.p
% 3.62/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.20
% 3.62/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.62/1.20
% 3.62/1.20 % ------ iProver source info
% 3.62/1.20
% 3.62/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.62/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.62/1.20 % git: non_committed_changes: false
% 3.62/1.20
% 3.62/1.20 % ------ Parsing...% successful
% 3.62/1.20
% 3.62/1.20
% 3.62/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.62/1.20
% 3.62/1.20 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.62/1.20
% 3.62/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.62/1.20
% 3.62/1.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.62/1.20 % ------ Proving...
% 3.62/1.20 % ------ Problem Properties
% 3.62/1.20
% 3.62/1.20 %
% 3.62/1.20 % clauses 2
% 3.62/1.20 % conjectures 1
% 3.62/1.20 % EPR 0
% 3.62/1.20 % Horn 2
% 3.62/1.20 % unary 1
% 3.62/1.20 % binary 0
% 3.62/1.20 % lits 5
% 3.62/1.20 % lits eq 5
% 3.62/1.20 % fd_pure 0
% 3.62/1.20 % fd_pseudo 0
% 3.62/1.20 % fd_cond 0
% 3.62/1.20 % fd_pseudo_cond 0
% 3.62/1.20 % AC symbols 0
% 3.62/1.20
% 3.62/1.20 % ------ Schedule dynamic 5 is on
% 3.62/1.20
% 3.62/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.20
% 3.62/1.20
% 3.62/1.20 % ------
% 3.62/1.20 % Current options:
% 3.62/1.20 % ------
% 3.62/1.20
% 3.62/1.20
% 3.62/1.20 %
% 3.62/1.20
% 3.62/1.20 % ------ Proving...
% 3.62/1.20 %
% 3.62/1.20
% 3.62/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.20
% 3.62/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.20
% 3.62/1.20
%------------------------------------------------------------------------------