TSTP Solution File: SET516-6 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET516-6 : 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 14:34:25 EDT 2023
% Result : Unsatisfiable 0.22s 0.62s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 69
% Syntax : Number of formulae : 102 ( 16 unt; 57 typ; 0 def)
% Number of atoms : 83 ( 33 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 26 ~; 38 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 47 ( 47 usr; 13 con; 0-3 aty)
% Number of variables : 50 ( 10 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 ).
cnf(prove_corollary_to_no_class_belongs_to_itself_1,negated_conjecture,
singleton(x) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_no_class_belongs_to_itself_1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
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(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
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(c_0_12,negated_conjecture,
singleton(x) = x,
prove_corollary_to_no_class_belongs_to_itself_1 ).
cnf(c_0_13,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_14,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_15,negated_conjecture,
unordered_pair(x,x) = x,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( X1 = x
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_18,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_19,negated_conjecture,
( regular(x) = x
| x = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_21,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_22,negated_conjecture,
( intersection(x,x) = null_class
| x = null_class ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_24,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_26,negated_conjecture,
( x = null_class
| member(X1,null_class)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
member(x,x),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24])]) ).
cnf(c_0_28,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( x = null_class
| member(x,null_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_31,negated_conjecture,
( x = null_class
| X1 = null_class
| member(x,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( complement(X1) = null_class
| x = null_class
| ~ member(x,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( complement(x) = null_class
| x = null_class ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( x = null_class
| ~ member(X1,null_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
x = null_class,
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
member(null_class,null_class),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_35]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( X1 = null_class
| member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( complement(X1) = null_class
| ~ member(null_class,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_37]) ).
cnf(c_0_39,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_40,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_41,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(null_class,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
cnf(c_0_42,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ member(null_class,X1),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[c_0_42,c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET516-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 13:41:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.58 start to proof: theBenchmark
% 0.22/0.62 % Version : CSE_E---1.5
% 0.22/0.62 % Problem : theBenchmark.p
% 0.22/0.62 % Proof found
% 0.22/0.62 % SZS status Theorem for theBenchmark.p
% 0.22/0.62 % SZS output start Proof
% See solution above
% 0.22/0.62 % Total time : 0.023000 s
% 0.22/0.62 % SZS output end Proof
% 0.22/0.62 % Total time : 0.028000 s
%------------------------------------------------------------------------------