%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP557-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 : n010.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.64s 1.36s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
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] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
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_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_137,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),inverse(X1)) = X1,
inference(superposition,[status(thm)],[c_98,c_118]) ).
tcf(c_220,plain,
! [X0: $i,X1: $i] : inverse(divide(X0,X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_137,c_98]) ).
tcf(c_282,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_220,c_220]) ).
tcf(c_302,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP557-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.08/0.54 % Computer : n010.cluster.edu
% 0.08/0.54 % Model : x86_64 x86_64
% 0.08/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.54 % Memory : 8046.5625MB
% 0.08/0.54 % OS : Linux 6.8.0-71-generic
% 0.08/0.54 % CPULimit : 300
% 0.08/0.54 % WCLimit : 300
% 0.08/0.54 % DateTime : Wed Sep 23 15:04:46 UTC 2026
% 0.08/0.55 % CPUTime :
% 0.08/0.55 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.58 Running UEQ theorem proving
% 0.12/0.58 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.12/0.59
% 0.12/0.59 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.59
% 0.12/0.59 % Detected problem language: tptp
% 0.12/0.60 % Proving...
% 2.64/1.36 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.64/1.36 % SZS status Started for theBenchmark.p
% 2.64/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 2.64/1.36
% 2.64/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.64/1.36
% 2.64/1.36 % ------ iProver source info
% 2.64/1.36
% 2.64/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 2.64/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.64/1.36 % git: non_committed_changes: false
% 2.64/1.36
% 2.64/1.36 % ------ Parsing...% successful
% 2.64/1.36
% 2.64/1.36
% 2.64/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.64/1.36
% 2.64/1.36 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.64/1.36
% 2.64/1.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.64/1.36
% 2.64/1.36 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.64/1.36 % ------ Proving...
% 2.64/1.36 % ------ Problem Properties
% 2.64/1.36
% 2.64/1.36 %
% 2.64/1.36 % clauses 2
% 2.64/1.36 % conjectures 1
% 2.64/1.36 % EPR 0
% 2.64/1.36 % Horn 2
% 2.64/1.36 % unary 2
% 2.64/1.36 % binary 0
% 2.64/1.36 % lits 2
% 2.64/1.36 % lits eq 2
% 2.64/1.36 % fd_pure 0
% 2.64/1.36 % fd_pseudo 0
% 2.64/1.36 % fd_cond 0
% 2.64/1.36 % fd_pseudo_cond 0
% 2.64/1.36 % AC symbols 0
% 2.64/1.36
% 2.64/1.36 % ------ Input Options Time Limit: Unbounded
% 2.64/1.36
% 2.64/1.36
% 2.64/1.36 % ------
% 2.64/1.36 % Current options:
% 2.64/1.36 % ------
% 2.64/1.36
% 2.64/1.36
% 2.64/1.36 %
% 2.64/1.36
% 2.64/1.36 % ------ Proving...
% 2.64/1.36 %
% 2.64/1.36
% 2.64/1.36 % SZS status Unsatisfiable for theBenchmark.p
% 2.64/1.36
% 2.64/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.64/1.36
% 2.64/1.36
%------------------------------------------------------------------------------