%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP521-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 : n004.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:38 PM UTC 2026
% Result : Unsatisfiable 2.00s 11.51s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 54 ( 0 sgn 54 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
inference(cnf_transformation,[],[f1]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X0),X1) = inverse(X1),
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[],[f4]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_54,c_55]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] : divide(inverse(divide(X0,X0)),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_55,c_55]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] : divide(multiply(inverse(X0),X0),X1) = inverse(X1),
inference(superposition,[status(thm)],[c_68,c_55]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_68,c_55]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] : multiply(inverse(divide(X0,X0)),X1) = inverse(inverse(X1)),
inference(superposition,[status(thm)],[c_116,c_68]) ).
tcf(c_229,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(X1,divide(X2,X0)),X1)) = X2,
inference(superposition,[status(thm)],[c_53,c_53]) ).
tcf(c_350,plain,
! [X0: $i,X1: $i] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[status(thm)],[c_55,c_229]) ).
tcf(c_492,plain,
! [X0: $i,X1: $i] : multiply(X0,divide(X1,X0)) = X1,
inference(demodulation,[status(thm)],[c_350,c_68]) ).
tcf(c_497,plain,
! [X0: $i,X1: $i] : multiply(X0,inverse(X0)) = divide(X1,X1),
inference(superposition,[status(thm)],[c_55,c_492]) ).
tcf(c_498,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_68,c_492]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[status(thm)],[c_497,c_497]) ).
tcf(c_746,plain,
! [X0: $i,X1: $i] : multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_597,c_492]) ).
tcf(c_848,plain,
! [X0: $i,X1: $i] : inverse(inverse(multiply(X0,divide(X1,X1)))) = X0,
inference(superposition,[status(thm)],[c_498,c_130]) ).
tcf(c_850,plain,
! [X0: $i] : inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_848,c_746]) ).
tcf(c_853,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X0),X1) = X1,
inference(demodulation,[status(thm)],[c_121,c_850]) ).
tcf(c_889,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_853,c_492]) ).
tcf(c_929,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_889,c_53]) ).
tcf(c_1023,plain,
! [X0: $i,X1: $i] : multiply(divide(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_929,c_492]) ).
tcf(c_1060,plain,
! [X0: $i,X1: $i] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[status(thm)],[c_120,c_1023]) ).
tcf(c_1066,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_1060]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP521-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.11/10.61 % Computer : n004.cluster.edu
% 0.11/10.61 % Model : x86_64 x86_64
% 0.11/10.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.61 % Memory : 8046.5625MB
% 0.11/10.61 % OS : Linux 6.8.0-71-generic
% 0.11/10.61 % CPULimit : 300
% 0.11/10.61 % WCLimit : 300
% 0.11/10.61 % DateTime : Wed Sep 23 14:58:49 UTC 2026
% 0.11/10.61 % CPUTime :
% 0.11/10.61 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/10.64 Running UEQ theorem proving
% 0.11/10.64 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.11/10.65
% 0.11/10.65 % ======== iProver multi-core TPTP/SMT =========
% 0.11/10.65
% 0.11/10.65 % Detected problem language: tptp
% 0.11/10.66 % Proving...
% 2.00/11.51 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.00/11.51 % SZS status Started for theBenchmark.p
% 2.00/11.51 % SZS status Unsatisfiable for theBenchmark.p
% 2.00/11.51
% 2.00/11.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.00/11.51
% 2.00/11.51 % ------ iProver source info
% 2.00/11.51
% 2.00/11.51 % git: date: 2026-07-19 20:42:38 +0200
% 2.00/11.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.00/11.51 % git: non_committed_changes: false
% 2.00/11.51
% 2.00/11.51 % ------ Parsing...% successful
% 2.00/11.51
% 2.00/11.51
% 2.00/11.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.00/11.51
% 2.00/11.51 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.00/11.51
% 2.00/11.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.00/11.51
% 2.00/11.51 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.00/11.51 % ------ Proving...
% 2.00/11.51 % ------ Problem Properties
% 2.00/11.51
% 2.00/11.51 %
% 2.00/11.51 % clauses 4
% 2.00/11.51 % conjectures 1
% 2.00/11.51 % EPR 0
% 2.00/11.51 % Horn 4
% 2.00/11.51 % unary 4
% 2.00/11.51 % binary 0
% 2.00/11.51 % lits 4
% 2.00/11.51 % lits eq 4
% 2.00/11.51 % fd_pure 0
% 2.00/11.51 % fd_pseudo 0
% 2.00/11.51 % fd_cond 0
% 2.00/11.51 % fd_pseudo_cond 0
% 2.00/11.51 % AC symbols 0
% 2.00/11.51
% 2.00/11.51 % ------ Input Options Time Limit: Unbounded
% 2.00/11.51
% 2.00/11.51
% 2.00/11.51 % ------
% 2.00/11.51 % Current options:
% 2.00/11.51 % ------
% 2.00/11.51
% 2.00/11.51
% 2.00/11.51 %
% 2.00/11.51
% 2.00/11.51 % ------ Proving...
% 2.00/11.51 %
% 2.00/11.51
% 2.00/11.51 % SZS status Unsatisfiable for theBenchmark.p
% 2.00/11.51
% 2.00/11.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.00/11.52
% 2.00/11.52
%------------------------------------------------------------------------------