TSTP Solution File: NUM139-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM139-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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:35 EDT 2023
% Result : Unsatisfiable 0.18s 0.71s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 89
% Syntax : Number of formulae : 104 ( 19 unt; 80 typ; 0 def)
% Number of atoms : 29 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 11 ( 2 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 : 64 ( 64 usr; 20 con; 0-3 aty)
% Number of variables : 32 ( 2 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 ).
tff(decl_101,type,
z: $i ).
cnf(image,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',image) ).
cnf(range_of,axiom,
domain_of(inverse(X1)) = range_of(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',range_of) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(power_class_definition,axiom,
complement(image(element_relation,complement(X1))) = power_class(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',power_class_definition) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inverse) ).
cnf(prove_complete_induction3_1,negated_conjecture,
~ member(not_subclass_element(intersection(power_class(x),z),x),z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complete_induction3_1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(prove_complete_induction3_2,negated_conjecture,
~ subclass(intersection(power_class(x),z),x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complete_induction3_2) ).
cnf(c_0_9,axiom,
range_of(restrict(X1,X2,universal_class)) = image(X1,X2),
image ).
cnf(c_0_10,axiom,
domain_of(inverse(X1)) = range_of(X1),
range_of ).
cnf(c_0_11,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_12,axiom,
complement(image(element_relation,complement(X1))) = power_class(X1),
power_class_definition ).
cnf(c_0_13,plain,
domain_of(inverse(intersection(X1,cross_product(X2,universal_class)))) = image(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_15,negated_conjecture,
~ member(not_subclass_element(intersection(power_class(x),z),x),z),
prove_complete_induction3_1 ).
cnf(c_0_16,plain,
complement(domain_of(domain_of(flip(cross_product(intersection(element_relation,cross_product(complement(X1),universal_class)),universal_class))))) = power_class(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_18,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_19,negated_conjecture,
~ subclass(intersection(power_class(x),z),x),
prove_complete_induction3_2 ).
cnf(c_0_20,negated_conjecture,
~ member(not_subclass_element(intersection(complement(domain_of(domain_of(flip(cross_product(intersection(element_relation,cross_product(complement(x),universal_class)),universal_class))))),z),x),z),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ subclass(intersection(complement(domain_of(domain_of(flip(cross_product(intersection(element_relation,cross_product(complement(x),universal_class)),universal_class))))),z),x),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM139-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri Aug 25 15:07:07 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.18/0.71 % Version : CSE_E---1.5
% 0.18/0.71 % Problem : theBenchmark.p
% 0.18/0.71 % Proof found
% 0.18/0.71 % SZS status Theorem for theBenchmark.p
% 0.18/0.71 % SZS output start Proof
% See solution above
% 0.18/0.72 % Total time : 0.137000 s
% 0.18/0.72 % SZS output end Proof
% 0.18/0.72 % Total time : 0.141000 s
%------------------------------------------------------------------------------