TSTP Solution File: SET014-6 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET014-6 : 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 : n026.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 14:32:05 EDT 2023
% Result : Unsatisfiable 63.84s 63.88s
% Output : CNFRefutation 63.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 73
% Syntax : Number of formulae : 132 ( 26 unt; 59 typ; 0 def)
% Number of atoms : 129 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 106 ( 50 ~; 56 |; 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 : 72 ( 44 >; 28 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 49 ( 49 usr; 15 con; 0-3 aty)
% Number of variables : 101 ( 9 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,
x: $i ).
tff(decl_79,type,
z: $i ).
tff(decl_80,type,
y: $i ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_least_upper_bound_2,negated_conjecture,
subclass(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_least_upper_bound_2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_least_upper_bound_1,negated_conjecture,
subclass(x,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_least_upper_bound_1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_least_upper_bound_3,negated_conjecture,
~ subclass(union(x,y),z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_least_upper_bound_3) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,negated_conjecture,
subclass(y,z),
prove_least_upper_bound_2 ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_17,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_18,negated_conjecture,
( member(X1,z)
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_20,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( member(not_subclass_element(y,X1),z)
| subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( subclass(y,intersection(X1,z))
| ~ member(not_subclass_element(y,intersection(X1,z)),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_25,negated_conjecture,
subclass(y,intersection(z,z)),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_27,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,intersection(z,z))
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_29,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_30,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_31,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_32,negated_conjecture,
( subclass(complement(intersection(z,z)),X1)
| ~ member(not_subclass_element(complement(intersection(z,z)),X1),y) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_35,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
subclass(x,z),
prove_least_upper_bound_1 ).
cnf(c_0_37,negated_conjecture,
subclass(complement(intersection(z,z)),complement(y)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_39,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_40,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( member(X1,z)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( member(X1,complement(y))
| ~ member(X1,complement(intersection(z,z))) ),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_43,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( member(not_subclass_element(x,X1),z)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_46,negated_conjecture,
( member(X1,complement(y))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_48,negated_conjecture,
subclass(x,complement(complement(z))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( subclass(X1,intersection(complement(y),X1))
| ~ member(not_subclass_element(X1,intersection(complement(y),X1)),complement(z)) ),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_19]) ).
cnf(c_0_51,negated_conjecture,
( member(X1,complement(complement(z)))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
subclass(complement(z),intersection(complement(y),complement(z))),
inference(spm,[status(thm)],[c_0_49,c_0_19]) ).
cnf(c_0_53,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(X1,complement(z))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_24,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
intersection(complement(y),complement(z)) = complement(z),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
( subclass(complement(z),X1)
| ~ member(not_subclass_element(complement(z),X1),x) ),
inference(spm,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_57,negated_conjecture,
( member(not_subclass_element(complement(z),X1),complement(y))
| subclass(complement(z),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
subclass(complement(z),complement(x)),
inference(spm,[status(thm)],[c_0_56,c_0_33]) ).
cnf(c_0_59,negated_conjecture,
( subclass(complement(z),intersection(X1,complement(y)))
| ~ member(not_subclass_element(complement(z),intersection(X1,complement(y))),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( member(X1,complement(x))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_14,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
subclass(complement(z),intersection(complement(x),complement(y))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_19]) ).
cnf(c_0_62,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_44,c_0_19]) ).
cnf(c_0_63,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( member(X1,intersection(complement(x),complement(y)))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_14,c_0_61]) ).
cnf(c_0_65,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_62]) ).
cnf(c_0_66,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_16,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
~ subclass(union(x,y),z),
prove_least_upper_bound_3 ).
cnf(c_0_68,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_69,negated_conjecture,
( subclass(complement(intersection(complement(x),complement(y))),X1)
| ~ member(not_subclass_element(complement(intersection(complement(x),complement(y))),X1),complement(z)) ),
inference(spm,[status(thm)],[c_0_27,c_0_64]) ).
cnf(c_0_70,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_71,negated_conjecture,
~ subclass(complement(intersection(complement(x),complement(y))),z),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_33]),c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET014-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.17/0.35 % Computer : n026.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sat Aug 26 09:43:18 EDT 2023
% 0.17/0.36 % CPUTime :
% 0.21/0.59 start to proof: theBenchmark
% 63.84/63.88 % Version : CSE_E---1.5
% 63.84/63.88 % Problem : theBenchmark.p
% 63.84/63.88 % Proof found
% 63.84/63.88 % SZS status Theorem for theBenchmark.p
% 63.84/63.88 % SZS output start Proof
% See solution above
% 63.84/63.89 % Total time : 63.279000 s
% 63.84/63.89 % SZS output end Proof
% 63.84/63.89 % Total time : 63.288000 s
%------------------------------------------------------------------------------