%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP533-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 : n005.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:40 PM UTC 2026
% Result : Unsatisfiable 1.83s 1.15s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% 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 : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 16 ( 0 sgn 16 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i] : divide(X0,X0) = identity,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[],[f5]) ).
tcf(c_73,plain,
! [X0: $i] : divide(identity,X0) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_56,c_57]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_55,c_57,c_73]) ).
tcf(c_130,plain,
! [X0: $i] : multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_74,c_57]) ).
tcf(c_132,plain,
multiply(inverse(b1),b1) != identity,
inference(demodulation,[status(thm)],[c_58,c_130]) ).
tcf(c_133,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_132,c_130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP533-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Wed Sep 23 15:00:17 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 Running UEQ theorem proving
% 0.14/0.39 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.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.40 % Detected problem language: tptp
% 0.14/0.41 % Proving...
% 1.83/1.15 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.83/1.15 % SZS status Started for theBenchmark.p
% 1.83/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/1.15
% 1.83/1.15 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.83/1.15
% 1.83/1.15 % ------ iProver source info
% 1.83/1.15
% 1.83/1.15 % git: date: 2026-07-19 20:42:38 +0200
% 1.83/1.15 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.83/1.15 % git: non_committed_changes: false
% 1.83/1.15
% 1.83/1.15 % ------ Parsing...% successful
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.83/1.15
% 1.83/1.15 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.83/1.15
% 1.83/1.15 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.83/1.15
% 1.83/1.15 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.83/1.15 % ------ Proving...
% 1.83/1.15 % ------ Problem Properties
% 1.83/1.15
% 1.83/1.15 %
% 1.83/1.15 % clauses 5
% 1.83/1.15 % conjectures 1
% 1.83/1.15 % EPR 0
% 1.83/1.15 % Horn 5
% 1.83/1.15 % unary 5
% 1.83/1.15 % binary 0
% 1.83/1.15 % lits 5
% 1.83/1.15 % lits eq 5
% 1.83/1.15 % fd_pure 0
% 1.83/1.15 % fd_pseudo 0
% 1.83/1.15 % fd_cond 0
% 1.83/1.15 % fd_pseudo_cond 0
% 1.83/1.15 % AC symbols 0
% 1.83/1.15
% 1.83/1.15 % ------ Input Options Time Limit: Unbounded
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 % ------
% 1.83/1.15 % Current options:
% 1.83/1.15 % ------
% 1.83/1.15
% 1.83/1.15
% 1.83/1.15 %
% 1.83/1.15
% 1.83/1.15 % ------ Proving...
% 1.83/1.15 %
% 1.83/1.15
% 1.83/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/1.15
% 1.83/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/1.15
% 1.83/1.15
%------------------------------------------------------------------------------