TSTP Solution File: NUM154-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM154-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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 : Thu Aug 31 10:26:41 EDT 2023
% Result : Unsatisfiable 0.63s 0.80s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 103
% Syntax : Number of formulae : 176 ( 38 unt; 79 typ; 0 def)
% Number of atoms : 168 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 130 ( 59 ~; 71 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 103 ( 60 >; 43 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 63 ( 63 usr; 19 con; 0-3 aty)
% Number of variables : 136 ( 31 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subclass: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
not_subclass_element: ( $i * $i ) > $i ).
tff(decl_25,type,
universal_class: $i ).
tff(decl_26,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_27,type,
singleton: $i > $i ).
tff(decl_28,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_29,type,
cross_product: ( $i * $i ) > $i ).
tff(decl_30,type,
first: $i > $i ).
tff(decl_31,type,
second: $i > $i ).
tff(decl_32,type,
element_relation: $i ).
tff(decl_33,type,
intersection: ( $i * $i ) > $i ).
tff(decl_34,type,
complement: $i > $i ).
tff(decl_35,type,
union: ( $i * $i ) > $i ).
tff(decl_36,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(decl_37,type,
restrict: ( $i * $i * $i ) > $i ).
tff(decl_38,type,
null_class: $i ).
tff(decl_39,type,
domain_of: $i > $i ).
tff(decl_40,type,
rotate: $i > $i ).
tff(decl_41,type,
flip: $i > $i ).
tff(decl_42,type,
inverse: $i > $i ).
tff(decl_43,type,
range_of: $i > $i ).
tff(decl_44,type,
domain: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
range: ( $i * $i * $i ) > $i ).
tff(decl_46,type,
image: ( $i * $i ) > $i ).
tff(decl_47,type,
successor: $i > $i ).
tff(decl_48,type,
successor_relation: $i ).
tff(decl_49,type,
inductive: $i > $o ).
tff(decl_50,type,
omega: $i ).
tff(decl_51,type,
sum_class: $i > $i ).
tff(decl_52,type,
power_class: $i > $i ).
tff(decl_53,type,
compose: ( $i * $i ) > $i ).
tff(decl_54,type,
single_valued_class: $i > $o ).
tff(decl_55,type,
identity_relation: $i ).
tff(decl_56,type,
function: $i > $o ).
tff(decl_57,type,
regular: $i > $i ).
tff(decl_58,type,
apply: ( $i * $i ) > $i ).
tff(decl_59,type,
choice: $i ).
tff(decl_60,type,
one_to_one: $i > $o ).
tff(decl_61,type,
subset_relation: $i ).
tff(decl_62,type,
diagonalise: $i > $i ).
tff(decl_63,type,
cantor: $i > $i ).
tff(decl_64,type,
operation: $i > $o ).
tff(decl_65,type,
compatible: ( $i * $i * $i ) > $o ).
tff(decl_66,type,
homomorphism: ( $i * $i * $i ) > $o ).
tff(decl_67,type,
not_homomorphism1: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
not_homomorphism2: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
compose_class: $i > $i ).
tff(decl_70,type,
composition_function: $i ).
tff(decl_71,type,
domain_relation: $i ).
tff(decl_72,type,
single_valued1: $i > $i ).
tff(decl_73,type,
single_valued2: $i > $i ).
tff(decl_74,type,
single_valued3: $i > $i ).
tff(decl_75,type,
singleton_relation: $i ).
tff(decl_76,type,
application_function: $i ).
tff(decl_77,type,
maps: ( $i * $i * $i ) > $o ).
tff(decl_78,type,
symmetrization_of: $i > $i ).
tff(decl_79,type,
irreflexive: ( $i * $i ) > $o ).
tff(decl_80,type,
connected: ( $i * $i ) > $o ).
tff(decl_81,type,
transitive: ( $i * $i ) > $o ).
tff(decl_82,type,
asymmetric: ( $i * $i ) > $o ).
tff(decl_83,type,
segment: ( $i * $i * $i ) > $i ).
tff(decl_84,type,
well_ordering: ( $i * $i ) > $o ).
tff(decl_85,type,
least: ( $i * $i ) > $i ).
tff(decl_86,type,
not_well_ordering: ( $i * $i ) > $i ).
tff(decl_87,type,
section: ( $i * $i * $i ) > $o ).
tff(decl_88,type,
ordinal_numbers: $i ).
tff(decl_89,type,
kind_1_ordinals: $i ).
tff(decl_90,type,
limit_ordinals: $i ).
tff(decl_91,type,
rest_of: $i > $i ).
tff(decl_92,type,
rest_relation: $i ).
tff(decl_93,type,
recursion_equation_functions: $i > $i ).
tff(decl_94,type,
union_of_range_map: $i ).
tff(decl_95,type,
recursion: ( $i * $i * $i ) > $i ).
tff(decl_96,type,
ordinal_add: ( $i * $i ) > $i ).
tff(decl_97,type,
add_relation: $i ).
tff(decl_98,type,
ordinal_multiply: ( $i * $i ) > $i ).
tff(decl_99,type,
integer_of: $i > $i ).
tff(decl_100,type,
x: $i ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inductive1) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).
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(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(recursion_equation_functions1,axiom,
( function(X2)
| ~ member(X1,recursion_equation_functions(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',recursion_equation_functions1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(function1,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',function1) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',successor) ).
cnf(cartesian_product4,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).
cnf(prove_corollary_5_to_successor_property1_1,negated_conjecture,
successor(x) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_5_to_successor_property1_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(c_0_24,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_25,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_26,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_27,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_29,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_30,plain,
( member(null_class,X1)
| ~ subclass(omega,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_32,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_34,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_35,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_36,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( complement(intersection(X1,X2)) = null_class
| ~ member(regular(complement(intersection(X1,X2))),X2)
| ~ member(regular(complement(intersection(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_39,axiom,
( function(X2)
| ~ member(X1,recursion_equation_functions(X2)) ),
recursion_equation_functions1 ).
cnf(c_0_40,plain,
( member(null_class,complement(X1))
| member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( complement(intersection(X1,universal_class)) = null_class
| ~ member(regular(complement(intersection(X1,universal_class))),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( recursion_equation_functions(X1) = null_class
| function(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_43,plain,
( member(null_class,X1)
| member(null_class,X2)
| ~ subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_44,plain,
complement(intersection(universal_class,universal_class)) = null_class,
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_45,plain,
( function(X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_39,c_0_42]) ).
cnf(c_0_46,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_47,plain,
( member(null_class,intersection(universal_class,universal_class))
| member(null_class,X1)
| ~ subclass(null_class,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( function(X1)
| subclass(null_class,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( function(X1)
| member(null_class,intersection(universal_class,universal_class))
| member(null_class,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_51,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_52,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_53,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_54,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_32,c_0_38]) ).
cnf(c_0_55,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_56,axiom,
( subclass(X1,cross_product(universal_class,universal_class))
| ~ function(X1) ),
function1 ).
cnf(c_0_57,plain,
( function(X1)
| member(null_class,intersection(universal_class,universal_class)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_49]),c_0_49]) ).
cnf(c_0_58,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_59,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_60,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_61,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_29]) ).
cnf(c_0_62,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_63,plain,
( member(null_class,intersection(universal_class,universal_class))
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_38]) ).
cnf(c_0_66,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_67,axiom,
( ordered_pair(first(X1),second(X1)) = X1
| ~ member(X1,cross_product(X2,X3)) ),
cartesian_product4 ).
cnf(c_0_68,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_51]),c_0_51]) ).
cnf(c_0_69,plain,
( ~ member(X1,intersection(universal_class,universal_class))
| ~ member(X1,null_class) ),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_70,plain,
( member(null_class,intersection(universal_class,universal_class))
| member(null_class,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_30,c_0_63]) ).
cnf(c_0_71,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,negated_conjecture,
successor(x) = null_class,
prove_corollary_5_to_successor_property1_1 ).
cnf(c_0_73,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_66,c_0_51]) ).
cnf(c_0_74,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_75,plain,
( unordered_pair(unordered_pair(first(X1),first(X1)),unordered_pair(first(X1),unordered_pair(second(X1),second(X1)))) = X1
| ~ member(X1,cross_product(X2,X3)) ),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,plain,
( member(null_class,cross_product(universal_class,universal_class))
| ~ member(null_class,null_class) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_77,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_71,c_0_29]) ).
cnf(c_0_78,negated_conjecture,
complement(intersection(complement(x),complement(unordered_pair(x,x)))) = null_class,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_79,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_80,plain,
( unordered_pair(unordered_pair(first(null_class),first(null_class)),unordered_pair(first(null_class),unordered_pair(second(null_class),second(null_class)))) = null_class
| ~ member(null_class,null_class) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_82,plain,
( X1 = null_class
| member(regular(X1),complement(X2))
| member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_83,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_71,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( member(null_class,intersection(complement(x),complement(unordered_pair(x,x))))
| member(null_class,null_class) ),
inference(spm,[status(thm)],[c_0_40,c_0_78]) ).
cnf(c_0_85,plain,
( member(unordered_pair(first(null_class),first(null_class)),null_class)
| ~ member(null_class,null_class) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81])]) ).
cnf(c_0_86,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_87,negated_conjecture,
( X1 = null_class
| member(regular(X1),intersection(complement(x),complement(unordered_pair(x,x)))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_78]),c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( member(null_class,complement(unordered_pair(x,x)))
| member(null_class,null_class) ),
inference(spm,[status(thm)],[c_0_55,c_0_84]) ).
cnf(c_0_89,plain,
~ member(null_class,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_85]),c_0_81])]) ).
cnf(c_0_90,negated_conjecture,
( X1 = null_class
| member(regular(X1),complement(x)) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,negated_conjecture,
member(null_class,complement(unordered_pair(x,x))),
inference(sr,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
( X1 = null_class
| ~ member(regular(X1),x) ),
inference(spm,[status(thm)],[c_0_28,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ member(null_class,unordered_pair(x,x)),
inference(spm,[status(thm)],[c_0_28,c_0_91]) ).
cnf(c_0_94,negated_conjecture,
x = null_class,
inference(spm,[status(thm)],[c_0_92,c_0_29]) ).
cnf(c_0_95,negated_conjecture,
~ member(null_class,unordered_pair(null_class,null_class)),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_79]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM154-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 10:40:58 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.54 start to proof: theBenchmark
% 0.63/0.80 % Version : CSE_E---1.5
% 0.63/0.80 % Problem : theBenchmark.p
% 0.63/0.80 % Proof found
% 0.63/0.80 % SZS status Theorem for theBenchmark.p
% 0.63/0.80 % SZS output start Proof
% See solution above
% 0.78/0.81 % Total time : 0.255000 s
% 0.78/0.81 % SZS output end Proof
% 0.78/0.81 % Total time : 0.262000 s
%------------------------------------------------------------------------------