%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP559-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:43 PM UTC 2026
% Result : Unsatisfiable 2.89s 1.17s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 43 :)
% 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(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/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] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,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_94,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_52,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X1))) = X0,
inference(superposition,[status(thm)],[c_52,c_94]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_98,c_94]) ).
tcf(c_135,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_98,c_118]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(divide(X1,inverse(divide(X2,X0))),X2))) = X1,
inference(superposition,[status(thm)],[c_118,c_52]) ).
tcf(c_202,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(inverse(divide(X2,X2)),X1)) = X0,
inference(superposition,[status(thm)],[c_135,c_52]) ).
tcf(c_463,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_135,c_202]) ).
tcf(c_903,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_118,c_463]) ).
tcf(c_912,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_463,c_118]) ).
tcf(c_920,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
inference(demodulation,[status(thm)],[c_53,c_912]) ).
tcf(c_943,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_118,c_903]) ).
tcf(c_950,plain,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,divide(inverse(b3),a3)),
inference(demodulation,[status(thm)],[c_920,c_943]) ).
tcf(c_951,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(b3),a3)),
inference(demodulation,[status(thm)],[c_950,c_943]) ).
tcf(c_975,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_903,c_943]) ).
tcf(c_1097,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
inference(demodulation,[status(thm)],[c_139,c_943]) ).
tcf(c_1118,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,X0))) = divide(X2,X1),
inference(superposition,[status(thm)],[c_1097,c_903]) ).
tcf(c_1221,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),X1) = divide(inverse(X1),X0),
inference(superposition,[status(thm)],[c_975,c_463]) ).
tcf(c_1228,plain,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_951,c_1221]) ).
tcf(c_1234,plain,
divide(a3,divide(inverse(b3),c3)) != divide(c3,divide(inverse(a3),b3)),
inference(demodulation,[status(thm)],[c_1228,c_1221]) ).
tcf(c_2068,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,X2)) = divide(X2,divide(X1,X0)),
inference(superposition,[status(thm)],[c_1118,c_903]) ).
tcf(c_2081,plain,
divide(a3,divide(inverse(b3),c3)) != divide(b3,divide(inverse(a3),c3)),
inference(demodulation,[status(thm)],[c_1234,c_2068]) ).
tcf(c_2168,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(inverse(X1),X2)) = divide(X1,divide(inverse(X2),X0)),
inference(superposition,[status(thm)],[c_1221,c_2068]) ).
tcf(c_2206,plain,
divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(c3),b3)),
inference(demodulation,[status(thm)],[c_2081,c_2168]) ).
tcf(c_2207,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2206,c_1221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP559-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n017.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 15:00:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 2.89/1.17 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.89/1.17 % SZS status Started for theBenchmark.p
% 2.89/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.17
% 2.89/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.89/1.17
% 2.89/1.17 % ------ iProver source info
% 2.89/1.17
% 2.89/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 2.89/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.89/1.17 % git: non_committed_changes: false
% 2.89/1.17
% 2.89/1.17 % ------ Parsing...% successful
% 2.89/1.17
% 2.89/1.17
% 2.89/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.89/1.17
% 2.89/1.17 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.89/1.17
% 2.89/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.89/1.17
% 2.89/1.17 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.89/1.17 % ------ Proving...
% 2.89/1.17 % ------ Problem Properties
% 2.89/1.17
% 2.89/1.17 %
% 2.89/1.17 % clauses 2
% 2.89/1.17 % conjectures 1
% 2.89/1.17 % EPR 0
% 2.89/1.17 % Horn 2
% 2.89/1.17 % unary 2
% 2.89/1.17 % binary 0
% 2.89/1.17 % lits 2
% 2.89/1.17 % lits eq 2
% 2.89/1.17 % fd_pure 0
% 2.89/1.17 % fd_pseudo 0
% 2.89/1.17 % fd_cond 0
% 2.89/1.17 % fd_pseudo_cond 0
% 2.89/1.17 % AC symbols 0
% 2.89/1.17
% 2.89/1.17 % ------ Input Options Time Limit: Unbounded
% 2.89/1.17
% 2.89/1.17
% 2.89/1.17 % ------
% 2.89/1.17 % Current options:
% 2.89/1.17 % ------
% 2.89/1.17
% 2.89/1.17
% 2.89/1.17 %
% 2.89/1.17
% 2.89/1.17 % ------ Proving...
% 2.89/1.17 %
% 2.89/1.17
% 2.89/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.17
% 2.89/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.17
% 2.89/1.17
%------------------------------------------------------------------------------