%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP097-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 : n009.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.69s 1.29s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 31 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 29 ~; 15 |; 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 : 54 ( 0 sgn 54 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,inverse(divide(divide(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,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(f4,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,[],[f3]) ).
fof(f5,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,[],[f4,f2,f2,f2,f2,f2,f2,f2,f2,f2,f2]) ).
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,[],[f5]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(X0,inverse(divide(X1,divide(X0,inverse(divide(divide(X1,X2),divide(X3,X2))))))) = X3,
inference(superposition,[status(thm)],[c_53,c_53]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X1))) = X0,
inference(superposition,[status(thm)],[c_53,c_114]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_118,c_114]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_118,c_146]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(divide(X1,inverse(divide(X2,X0))),X2))) = X1,
inference(superposition,[status(thm)],[c_146,c_53]) ).
tcf(c_229,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(inverse(divide(X2,X2)),X1)) = X0,
inference(superposition,[status(thm)],[c_167,c_53]) ).
tcf(c_235,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_167,c_118]) ).
tcf(c_302,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_235,c_235]) ).
tcf(c_303,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_235,c_167]) ).
tcf(c_321,plain,
( ( divide(a4,inverse(b4)) != divide(b4,inverse(a4)) )
| ( 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_302]) ).
tcf(c_322,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_321,c_303]) ).
tcf(c_512,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_167,c_229]) ).
tcf(c_910,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_146,c_512]) ).
tcf(c_919,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_512,c_146]) ).
tcf(c_959,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(ground_joinability,[status(thm)],[c_322,c_919]) ).
tcf(c_960,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
inference(demodulation,[status(thm)],[c_959,c_919]) ).
tcf(c_967,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_146,c_910]) ).
tcf(c_974,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,divide(inverse(b3),a3)),
inference(demodulation,[status(thm)],[c_960,c_967]) ).
tcf(c_975,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(b3),a3)),
inference(demodulation,[status(thm)],[c_974,c_967]) ).
tcf(c_999,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_910,c_967]) ).
tcf(c_1099,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
inference(demodulation,[status(thm)],[c_171,c_967]) ).
tcf(c_1120,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,X0))) = divide(X2,X1),
inference(superposition,[status(thm)],[c_1099,c_910]) ).
tcf(c_1196,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),X1) = divide(inverse(X1),X0),
inference(superposition,[status(thm)],[c_999,c_512]) ).
tcf(c_1203,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_975,c_1196]) ).
tcf(c_1209,plain,
divide(a3,divide(inverse(b3),c3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_1203,c_1196]) ).
tcf(c_1998,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
inference(superposition,[status(thm)],[c_1120,c_910]) ).
tcf(c_2011,plain,
divide(a3,divide(inverse(b3),c3)) != divide(b3,divide(inverse(a3),c3)),
inference(demodulation,[status(thm)],[c_1209,c_1998]) ).
tcf(c_2094,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = divide(X1,divide(inverse(X2),X0)),
inference(superposition,[status(thm)],[c_1196,c_1998]) ).
tcf(c_2132,plain,
divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(c3),b3)),
inference(demodulation,[status(thm)],[c_2011,c_2094]) ).
tcf(c_2133,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2132,c_1196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP097-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.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 13:31:28 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 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.03/0.41
% 0.03/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.41
% 0.03/0.41 % Detected problem language: tptp
% 0.03/0.42 % Proving...
% 3.69/1.29 % SZS status Started for theBenchmark.p
% 3.69/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.69/1.29
% 3.69/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.69/1.29
% 3.69/1.29 % ------ iProver source info
% 3.69/1.29
% 3.69/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.69/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.69/1.29 % git: non_committed_changes: false
% 3.69/1.29
% 3.69/1.29 % ------ Parsing...% successful
% 3.69/1.29
% 3.69/1.29
% 3.69/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.69/1.29
% 3.69/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.69/1.29
% 3.69/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.69/1.29
% 3.69/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.69/1.29 % ------ Proving...
% 3.69/1.29 % ------ Problem Properties
% 3.69/1.29
% 3.69/1.29 %
% 3.69/1.29 % clauses 2
% 3.69/1.29 % conjectures 1
% 3.69/1.29 % EPR 0
% 3.69/1.29 % Horn 2
% 3.69/1.29 % unary 1
% 3.69/1.29 % binary 0
% 3.69/1.29 % lits 5
% 3.69/1.29 % lits eq 5
% 3.69/1.29 % fd_pure 0
% 3.69/1.29 % fd_pseudo 0
% 3.69/1.29 % fd_cond 0
% 3.69/1.29 % fd_pseudo_cond 0
% 3.69/1.29 % AC symbols 0
% 3.69/1.29
% 3.69/1.29 % ------ Schedule dynamic 5 is on
% 3.69/1.29
% 3.69/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.29
% 3.69/1.29
% 3.69/1.29 % ------
% 3.69/1.29 % Current options:
% 3.69/1.29 % ------
% 3.69/1.29
% 3.69/1.29
% 3.69/1.29 %
% 3.69/1.29
% 3.69/1.29 % ------ Proving...
% 3.69/1.29 %
% 3.69/1.29
% 3.69/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 3.69/1.29
% 3.69/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.29
% 3.69/1.29
%------------------------------------------------------------------------------