%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM183-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:52:56 PM UTC 2026
% Result : Unsatisfiable 1.33s 1.74s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 13 unt; 2 nHn; 17 RR)
% Number of literals : 36 ( 2 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% 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 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(limit_ordinals,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',limit_ordinals) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_ordinals_are_kind_1_or_limit_1,negated_conjecture,
member(x,ordinal_numbers),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_1) ).
cnf(prove_ordinals_are_kind_1_or_limit_3,negated_conjecture,
~ member(x,limit_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(prove_ordinals_are_kind_1_or_limit_2,negated_conjecture,
~ member(x,kind_1_ordinals),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordinals_are_kind_1_or_limit_2) ).
cnf(c_0_8,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_9,axiom,
intersection(complement(kind_1_ordinals),ordinal_numbers) = limit_ordinals,
limit_ordinals ).
cnf(c_0_10,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( member(X1,limit_ordinals)
| ~ member(X1,complement(kind_1_ordinals))
| ~ member(X1,ordinal_numbers) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
member(x,ordinal_numbers),
prove_ordinals_are_kind_1_or_limit_1 ).
cnf(c_0_14,negated_conjecture,
~ member(x,limit_ordinals),
prove_ordinals_are_kind_1_or_limit_3 ).
cnf(c_0_15,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ member(x,complement(kind_1_ordinals)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_18,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ member(x,kind_1_ordinals),
prove_ordinals_are_kind_1_or_limit_2 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM183-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n013.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 00:15:41 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.33/1.74 % Version : CSE_E---1.7
% 1.33/1.74 % Problem : theBenchmark.p
% 1.33/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.33/1.74 % SZS output start CNFRefutation
% See solution above
% 1.33/1.74 % Total time : 1.374s
%------------------------------------------------------------------------------