%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRP465-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 : 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:19 PM UTC 2026
% Result : Unsatisfiable 3.61s 1.33s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 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; 4 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn 62 !; 0 ?; 55 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(identity,X0),X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f5,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f6,plain,
! [X0] : divide(X0,X0) = identity,
inference(reorient_equations,[],[f5]) ).
fof(f7,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f8,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(definition_unfolding,[],[f7,f2,f2,f2,f2]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(divide(divide(X0,X0),X1),X2),divide(divide(identity,X0),X2))) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i] : divide(X0,X0) = identity,
inference(cnf_transformation,[],[f6]) ).
tcf(c_56,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(cnf_transformation,[],[f8]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : divide(X0,divide(divide(divide(identity,X1),X2),divide(divide(identity,X0),X2))) = X1,
inference(light_normalisation,[status(thm)],[c_54,c_55]) ).
tcf(c_95,plain,
! [X0: $i] : divide(X0,identity) = X0,
inference(superposition,[status(thm)],[c_55,c_65]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] : divide(X0,divide(divide(divide(identity,X1),divide(identity,X0)),identity)) = X1,
inference(superposition,[status(thm)],[c_55,c_65]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] : divide(identity,divide(divide(divide(identity,X0),X1),divide(identity,X1))) = X0,
inference(superposition,[status(thm)],[c_55,c_65]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : divide(divide(divide(divide(identity,X0),X1),divide(divide(identity,identity),X1)),divide(divide(divide(identity,X2),X3),divide(X0,X3))) = X2,
inference(superposition,[status(thm)],[c_65,c_65]) ).
tcf(c_199,plain,
! [X0: $i,X1: $i] : divide(X0,divide(divide(identity,X1),divide(identity,X0))) = X1,
inference(demodulation,[status(thm)],[c_100,c_95]) ).
tcf(c_205,plain,
! [X0: $i] : divide(identity,divide(divide(identity,X0),identity)) = X0,
inference(superposition,[status(thm)],[c_55,c_199]) ).
tcf(c_260,plain,
! [X0: $i] : divide(identity,divide(identity,X0)) = X0,
inference(demodulation,[status(thm)],[c_205,c_95]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i] : divide(X0,divide(X1,divide(identity,X0))) = divide(identity,X1),
inference(superposition,[status(thm)],[c_260,c_199]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i] : divide(divide(divide(identity,X0),X1),divide(identity,X1)) = divide(identity,X0),
inference(superposition,[status(thm)],[c_102,c_260]) ).
tcf(c_335,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(identity,X0),divide(divide(divide(identity,X1),X2),divide(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_103,c_95,c_286]) ).
tcf(c_342,plain,
! [X0: $i,X1: $i] : divide(divide(identity,X0),divide(identity,divide(X0,divide(identity,X1)))) = X1,
inference(superposition,[status(thm)],[c_55,c_335]) ).
tcf(c_348,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(identity,X0),divide(divide(X1,X2),divide(X0,X2))) = divide(identity,X1),
inference(superposition,[status(thm)],[c_260,c_335]) ).
tcf(c_418,plain,
! [X0: $i,X1: $i] : divide(divide(X0,divide(identity,X1)),X1) = divide(identity,divide(identity,X0)),
inference(superposition,[status(thm)],[c_342,c_265]) ).
tcf(c_422,plain,
! [X0: $i,X1: $i] : divide(divide(X0,divide(identity,X1)),X1) = X0,
inference(light_normalisation,[status(thm)],[c_418,c_260]) ).
tcf(c_433,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),divide(identity,X1)) = X0,
inference(superposition,[status(thm)],[c_260,c_422]) ).
tcf(c_461,plain,
! [X0: $i,X1: $i] : divide(identity,divide(X0,X1)) = divide(X1,X0),
inference(superposition,[status(thm)],[c_433,c_265]) ).
tcf(c_463,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(demodulation,[status(thm)],[c_56,c_461]) ).
tcf(c_952,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(identity,divide(X0,X1)),divide(divide(X2,divide(identity,X1)),X0)) = divide(identity,X2),
inference(superposition,[status(thm)],[c_433,c_348]) ).
tcf(c_974,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(divide(X2,divide(identity,X0)),X1)) = divide(identity,X2),
inference(light_normalisation,[status(thm)],[c_952,c_461]) ).
tcf(c_1102,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(identity,divide(X2,X0)),
inference(superposition,[status(thm)],[c_433,c_974]) ).
tcf(c_1220,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,X1),divide(X2,X1)) = divide(X0,X2),
inference(demodulation,[status(thm)],[c_1102,c_461]) ).
tcf(c_1227,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(X0,divide(identity,X1)),X2) = divide(X0,divide(X2,X1)),
inference(superposition,[status(thm)],[c_422,c_1220]) ).
tcf(c_1259,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_463,c_1227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP465-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 % Computer : n017.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Wed Sep 23 14:45:31 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.43 Running UEQ theorem proving
% 0.14/0.43 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.44
% 0.14/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.46 % Proving...
% 3.61/1.33 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.61/1.33 % SZS status Started for theBenchmark.p
% 3.61/1.33 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.33
% 3.61/1.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.61/1.33
% 3.61/1.33 % ------ iProver source info
% 3.61/1.33
% 3.61/1.33 % git: date: 2026-07-19 20:42:38 +0200
% 3.61/1.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.61/1.33 % git: non_committed_changes: false
% 3.61/1.33
% 3.61/1.33 % ------ Parsing...% successful
% 3.61/1.33
% 3.61/1.33
% 3.61/1.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.61/1.33
% 3.61/1.33 % ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.61/1.33
% 3.61/1.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.61/1.33
% 3.61/1.33 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.61/1.33 % ------ Proving...
% 3.61/1.33 % ------ Problem Properties
% 3.61/1.33
% 3.61/1.33 %
% 3.61/1.33 % clauses 3
% 3.61/1.33 % conjectures 1
% 3.61/1.33 % EPR 0
% 3.61/1.33 % Horn 3
% 3.61/1.33 % unary 3
% 3.61/1.33 % binary 0
% 3.61/1.33 % lits 3
% 3.61/1.33 % lits eq 3
% 3.61/1.33 % fd_pure 0
% 3.61/1.33 % fd_pseudo 0
% 3.61/1.33 % fd_cond 0
% 3.61/1.33 % fd_pseudo_cond 0
% 3.61/1.33 % AC symbols 0
% 3.61/1.33
% 3.61/1.33 % ------ Input Options Time Limit: Unbounded
% 3.61/1.33
% 3.61/1.33
% 3.61/1.33 % ------
% 3.61/1.33 % Current options:
% 3.61/1.33 % ------
% 3.61/1.33
% 3.61/1.33
% 3.61/1.33 %
% 3.61/1.33
% 3.61/1.33 % ------ Proving...
% 3.61/1.33 %
% 3.61/1.33
% 3.61/1.33 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.33
% 3.61/1.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.33
% 3.61/1.33
%------------------------------------------------------------------------------