TSTP Solution File: SET071-7 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET071-7 : 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 : n013.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:45 EDT 2023
% Result : Unsatisfiable 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 59
% Syntax : Number of formulae : 82 ( 20 unt; 49 typ; 0 def)
% Number of atoms : 50 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 17 |; 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 : 65 ( 39 >; 26 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 40 ( 40 usr; 10 con; 0-3 aty)
% Number of variables : 36 ( 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,
x: $i ).
tff(decl_70,type,
y: $i ).
cnf(unordered_pair_equals_singleton1,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_null_unordered_pair_3,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_3) ).
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(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
cnf(prove_null_unordered_pair_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_2) ).
cnf(prove_null_unordered_pair_1,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_null_unordered_pair_1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(c_0_10,axiom,
( member(X1,universal_class)
| unordered_pair(X2,X1) = singleton(X2) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,negated_conjecture,
~ member(y,universal_class),
prove_null_unordered_pair_3 ).
cnf(c_0_13,plain,
( unordered_pair(X2,X1) = unordered_pair(X2,X2)
| member(X1,universal_class) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
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(X1,y) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( X1 = X2
| ~ member(X1,unordered_pair(X2,y)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_18,negated_conjecture,
~ member(x,universal_class),
prove_null_unordered_pair_2 ).
cnf(c_0_19,negated_conjecture,
( X1 = X2
| ~ member(X1,unordered_pair(y,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
unordered_pair(X1,x) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(x,y) != null_class,
prove_null_unordered_pair_1 ).
cnf(c_0_22,negated_conjecture,
( X1 = y
| ~ member(X1,unordered_pair(x,x)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_15]) ).
cnf(c_0_23,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_24,negated_conjecture,
unordered_pair(x,x) != null_class,
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
regular(unordered_pair(x,x)) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
member(y,unordered_pair(x,x)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
y = x,
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_28,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_29,negated_conjecture,
member(x,unordered_pair(x,x)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( member(x,X1)
| ~ subclass(unordered_pair(x,x),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET071-7 : 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.13/0.34 % Computer : n013.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 09:38:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.028000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.033000 s
%------------------------------------------------------------------------------