%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP556-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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 1.72s 26.02s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 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 : 7 ( 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 : 47 ( 0 sgn 47 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(X0,inverse(divide(X1,divide(X0,X2)))),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(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f4,plain,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(definition_unfolding,[],[f3,f2,f2]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(divide(X1,divide(X0,X2)))),X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,negated_conjecture,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(divide(X0,inverse(divide(X1,divide(X0,X2)))),inverse(divide(X3,X1))),X2) = X3,
inference(superposition,[status(thm)],[c_52,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_52,c_93]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(X1,divide(X0,X2)))) = divide(X2,inverse(X1)),
inference(superposition,[status(thm)],[c_52,c_98]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(divide(X1,X2))),inverse(divide(X2,X0))) = X1,
inference(superposition,[status(thm)],[c_98,c_52]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X1)),inverse(X0)) = X1,
inference(superposition,[status(thm)],[c_98,c_98]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] : divide(divide(X0,inverse(X1)),X0) = X1,
inference(demodulation,[status(thm)],[c_52,c_121]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] : divide(inverse(X0),inverse(X1)) = inverse(divide(X0,X1)),
inference(superposition,[status(thm)],[c_127,c_98]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] : inverse(divide(divide(X0,X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_127,c_171]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,inverse(X1)),X2) = divide(X1,divide(X2,X0)),
inference(superposition,[status(thm)],[c_121,c_129]) ).
tcf(c_225,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(demodulation,[status(thm)],[c_129,c_222]) ).
tcf(c_258,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(inverse(divide(X1,X2)),X2)) = X0,
inference(demodulation,[status(thm)],[c_125,c_222]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X1))) = X0,
inference(superposition,[status(thm)],[c_258,c_225]) ).
tcf(c_325,plain,
! [X0: $i,X1: $i] : inverse(divide(divide(X0,X0),X1)) = X1,
inference(superposition,[status(thm)],[c_225,c_173]) ).
tcf(c_566,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,inverse(divide(X1,X1))) = divide(X2,divide(X2,X0)),
inference(superposition,[status(thm)],[c_325,c_121]) ).
tcf(c_573,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_566,c_319]) ).
tcf(c_588,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = divide(X1,inverse(X0)),
inference(superposition,[status(thm)],[c_573,c_121]) ).
tcf(c_599,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_588]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP556-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.04/25.26 % CPULimit : 300
% 0.04/25.26 % WCLimit : 300
% 0.04/25.26 % DateTime : Wed Sep 23 15:04:38 UTC 2026
% 0.04/25.26 % CPUTime :
% 0.04/25.26 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/25.28 Running UEQ theorem proving
% 0.04/25.28 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.04/25.28
% 0.04/25.28 % ======== iProver multi-core TPTP/SMT =========
% 0.04/25.28
% 0.04/25.28 % Detected problem language: tptp
% 0.04/25.29 % Proving...
% 1.72/26.02 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.72/26.02 % SZS status Started for theBenchmark.p
% 1.72/26.02 % SZS status Unsatisfiable for theBenchmark.p
% 1.72/26.02
% 1.72/26.02 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.72/26.02
% 1.72/26.02 % ------ iProver source info
% 1.72/26.02
% 1.72/26.02 % git: date: 2026-07-19 20:42:38 +0200
% 1.72/26.02 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.72/26.02 % git: non_committed_changes: false
% 1.72/26.02
% 1.72/26.02 % ------ Parsing...% successful
% 1.72/26.02
% 1.72/26.02
% 1.72/26.02 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.72/26.02
% 1.72/26.02 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.72/26.02
% 1.72/26.02 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.72/26.02
% 1.72/26.02 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.72/26.02 % ------ Proving...
% 1.72/26.02 % ------ Problem Properties
% 1.72/26.02
% 1.72/26.02 %
% 1.72/26.02 % clauses 2
% 1.72/26.02 % conjectures 1
% 1.72/26.02 % EPR 0
% 1.72/26.02 % Horn 2
% 1.72/26.02 % unary 2
% 1.72/26.02 % binary 0
% 1.72/26.02 % lits 2
% 1.72/26.02 % lits eq 2
% 1.72/26.02 % fd_pure 0
% 1.72/26.02 % fd_pseudo 0
% 1.72/26.02 % fd_cond 0
% 1.72/26.02 % fd_pseudo_cond 0
% 1.72/26.02 % AC symbols 0
% 1.72/26.02
% 1.72/26.02 % ------ Input Options Time Limit: Unbounded
% 1.72/26.02
% 1.72/26.02
% 1.72/26.02 % ------
% 1.72/26.02 % Current options:
% 1.72/26.02 % ------
% 1.72/26.02
% 1.72/26.02
% 1.72/26.02 %
% 1.72/26.02
% 1.72/26.02 % ------ Proving...
% 1.72/26.02 %
% 1.72/26.02
% 1.72/26.02 % SZS status Unsatisfiable for theBenchmark.p
% 1.72/26.02
% 1.72/26.02 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.72/26.02
% 1.72/26.02
%------------------------------------------------------------------------------