TSTP Solution File: SET411-6 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET411-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 : n004.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:34:10 EDT 2023
% Result : Unsatisfiable 0.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 68
% Syntax : Number of formulae : 88 ( 18 unt; 58 typ; 0 def)
% Number of atoms : 44 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 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 : 48 ( 48 usr; 14 con; 0-3 aty)
% Number of variables : 36 ( 4 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,
y: $i ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_compose_condition_for_singleton_membership1_1,negated_conjecture,
member(ordered_pair(x,y),singleton_relation),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compose_condition_for_singleton_membership1_1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(compose_can_define_singleton,axiom,
intersection(complement(compose(element_relation,complement(identity_relation))),element_relation) = singleton_relation,
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-1.ax',compose_can_define_singleton) ).
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(equal_implies_subclass2,axiom,
( subclass(X2,X1)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).
cnf(element_relation2,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',element_relation2) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(prove_compose_condition_for_singleton_membership1_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compose_condition_for_singleton_membership1_2) ).
cnf(c_0_10,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,negated_conjecture,
member(ordered_pair(x,y),singleton_relation),
prove_compose_condition_for_singleton_membership1_1 ).
cnf(c_0_13,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_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_15,axiom,
intersection(complement(compose(element_relation,complement(identity_relation))),element_relation) = singleton_relation,
compose_can_define_singleton ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),singleton_relation),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
( subclass(X2,X1)
| X1 != X2 ),
equal_implies_subclass2 ).
cnf(c_0_19,axiom,
( member(X1,X2)
| ~ member(ordered_pair(X1,X2),element_relation) ),
element_relation2 ).
cnf(c_0_20,plain,
( member(X1,element_relation)
| ~ member(X1,singleton_relation) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),X1)
| ~ subclass(singleton_relation,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
subclass(X1,X1),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( member(X1,X2)
| ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),element_relation) ),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),element_relation),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
member(x,y),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( member(x,X1)
| ~ subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_27,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_28,negated_conjecture,
~ member(x,universal_class),
prove_compose_condition_for_singleton_membership1_2 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET411-6 : 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 09:29:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.61 % Version : CSE_E---1.5
% 0.21/0.61 % Problem : theBenchmark.p
% 0.21/0.61 % Proof found
% 0.21/0.61 % SZS status Theorem for theBenchmark.p
% 0.21/0.61 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.022000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.027000 s
%------------------------------------------------------------------------------