%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM183-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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 02:23:27 PM UTC 2026
% Result : Unsatisfiable 3.95s 1.17s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 42 ( 2 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 20 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
fof(f4,axiom,
! [X0] : subclass(X0,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
fof(f23,axiom,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
fof(f25,axiom,
! [X0,X1] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
fof(f155,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',limit_ordinals) ).
fof(f176,negated_conjecture,
member(x,ordinal_numbers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_1) ).
fof(f177,negated_conjecture,
~ member(x,kind_1_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_2) ).
fof(f178,negated_conjecture,
~ member(x,limit_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_3) ).
tcf(c_210,negated_conjecture,
member(x,ordinal_numbers),
inference(cnf_transformation,[],[f176]) ).
tcf(c_211,negated_conjecture,
~ member(x,kind_1_ordinals),
inference(cnf_transformation,[],[f177]) ).
tcf(c_212,negated_conjecture,
~ member(x,limit_ordinals),
inference(cnf_transformation,[],[f178]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subclass(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_218,plain,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
inference(cnf_transformation,[],[f155]) ).
tcf(c_223,plain,
! [X0: $i] : subclass(X0,universal_class),
inference(cnf_transformation,[],[f4]) ).
tcf(c_229,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_232,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| member(X0,complement(X1))
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_1496,plain,
! [X0: $i] :
( member(x,X0)
| ~ subclass(ordinal_numbers,X0) ),
inference(superposition,[status(thm)],[c_210,c_213]) ).
tcf(c_1520,plain,
member(x,universal_class),
inference(superposition,[status(thm)],[c_223,c_1496]) ).
tcf(c_1668,plain,
! [X0: $i] :
( member(X0,limit_ordinals)
| ~ member(X0,ordinal_numbers)
| ~ member(X0,complement(kind_1_ordinals)) ),
inference(superposition,[status(thm)],[c_218,c_229]) ).
tcf(c_1739,plain,
! [X0: $i] :
( member(X0,limit_ordinals)
| member(X0,kind_1_ordinals)
| ~ member(X0,universal_class)
| ~ member(X0,ordinal_numbers) ),
inference(superposition,[status(thm)],[c_232,c_1668]) ).
tcf(c_1754,plain,
( member(x,limit_ordinals)
| member(x,kind_1_ordinals)
| ~ member(x,universal_class) ),
inference(superposition,[status(thm)],[c_210,c_1739]) ).
tcf(c_1755,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1754,c_212,c_211,c_1520]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM183-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 03:08:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.95/1.17 % SZS status Started for theBenchmark.p
% 3.95/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.17
% 3.95/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.95/1.17
% 3.95/1.17 % ------ iProver source info
% 3.95/1.17
% 3.95/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.95/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.95/1.17 % git: non_committed_changes: false
% 3.95/1.17
% 3.95/1.17 % ------ Parsing...% successful
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.95/1.17
% 3.95/1.17 % ------ Preprocessing... sup_sim: 7 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.95/1.17
% 3.95/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.95/1.17
% 3.95/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.17 % ------ Proving...
% 3.95/1.17 % ------ Problem Properties
% 3.95/1.17
% 3.95/1.17 %
% 3.95/1.17 % clauses 34
% 3.95/1.17 % conjectures 3
% 3.95/1.17 % EPR 9
% 3.95/1.17 % Horn 32
% 3.95/1.17 % unary 14
% 3.95/1.17 % binary 10
% 3.95/1.17 % lits 65
% 3.95/1.17 % lits eq 6
% 3.95/1.17 % fd_pure 0
% 3.95/1.17 % fd_pseudo 0
% 3.95/1.17 % fd_cond 0
% 3.95/1.17 % fd_pseudo_cond 1
% 3.95/1.17 % AC symbols 0
% 3.95/1.17
% 3.95/1.17 % ------ Schedule dynamic 5 is on
% 3.95/1.17
% 3.95/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 % ------
% 3.95/1.17 % Current options:
% 3.95/1.17 % ------
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 %
% 3.95/1.17
% 3.95/1.17 % ------ Proving...
% 3.95/1.17 %
% 3.95/1.17
% 3.95/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.17
% 3.95/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.17
% 3.95/1.17
%------------------------------------------------------------------------------