TSTP Solution File: NUM071-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM071-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 : 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 10:26:22 EDT 2023
% Result : Unsatisfiable 2.47s 2.56s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 95
% Syntax : Number of formulae : 132 ( 20 unt; 81 typ; 0 def)
% Number of atoms : 103 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 100 ( 48 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 1 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 : 65 ( 65 usr; 21 con; 0-3 aty)
% Number of variables : 82 ( 8 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,
xr: $i ).
tff(decl_101,type,
y: $i ).
tff(decl_102,type,
u: $i ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
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(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(prove_well_ordering_is_irreflexive_3,negated_conjecture,
member(u,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_well_ordering_is_irreflexive_3) ).
cnf(well_ordering3,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',well_ordering3) ).
cnf(prove_well_ordering_is_irreflexive_1,negated_conjecture,
well_ordering(xr,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_well_ordering_is_irreflexive_1) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
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(well_ordering5,axiom,
( ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3)
| ~ member(ordered_pair(X4,least(X1,X3)),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',well_ordering5) ).
cnf(prove_well_ordering_is_irreflexive_2,negated_conjecture,
member(ordered_pair(u,u),xr),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_well_ordering_is_irreflexive_2) ).
cnf(equal_implies_subclass2,axiom,
( subclass(X2,X1)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',equal_implies_subclass2) ).
cnf(c_0_14,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_15,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_17,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
member(u,y),
prove_well_ordering_is_irreflexive_3 ).
cnf(c_0_20,axiom,
( member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3) ),
well_ordering3 ).
cnf(c_0_21,negated_conjecture,
well_ordering(xr,y),
prove_well_ordering_is_irreflexive_1 ).
cnf(c_0_22,negated_conjecture,
( not_subclass_element(unordered_pair(X1,u),y) = X1
| subclass(unordered_pair(X1,u),y) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_24,negated_conjecture,
( member(least(xr,X1),X1)
| ~ member(X2,X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( subclass(unordered_pair(X1,u),y)
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( member(u,X1)
| ~ subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_27,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_28,negated_conjecture,
( member(least(xr,unordered_pair(X1,u)),unordered_pair(X1,u))
| ~ member(X2,unordered_pair(X1,u))
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_30,negated_conjecture,
member(u,universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_32,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_33,negated_conjecture,
( member(least(xr,unordered_pair(X1,u)),unordered_pair(X1,u))
| ~ member(X1,y) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,axiom,
( ~ well_ordering(X1,X2)
| ~ subclass(X3,X2)
| ~ member(X4,X3)
| ~ member(ordered_pair(X4,least(X1,X3)),X1) ),
well_ordering5 ).
cnf(c_0_35,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_31,c_0_32]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( least(xr,unordered_pair(X1,u)) = u
| least(xr,unordered_pair(X1,u)) = X1
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
member(ordered_pair(u,u),xr),
prove_well_ordering_is_irreflexive_2 ).
cnf(c_0_38,plain,
( ~ subclass(X3,X2)
| ~ member(X4,X3)
| ~ well_ordering(X1,X2)
| ~ member(unordered_pair(unordered_pair(X4,X4),unordered_pair(X4,unordered_pair(least(X1,X3),least(X1,X3)))),X1) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
least(xr,unordered_pair(u,u)) = u,
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_40,negated_conjecture,
member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(u,u))),xr),
inference(rw,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_41,axiom,
( subclass(X2,X1)
| X1 != X2 ),
equal_implies_subclass2 ).
cnf(c_0_42,negated_conjecture,
( ~ well_ordering(xr,X1)
| ~ member(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(u,u))),xr)
| ~ member(X2,unordered_pair(u,u))
| ~ subclass(unordered_pair(u,u),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( member(unordered_pair(unordered_pair(u,u),unordered_pair(u,unordered_pair(u,u))),X1)
| ~ subclass(xr,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
member(u,unordered_pair(u,u)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_39]),c_0_19])]) ).
cnf(c_0_45,plain,
subclass(X1,X1),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ~ well_ordering(xr,X1)
| ~ subclass(unordered_pair(u,u),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_47,plain,
( not_subclass_element(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_17])]) ).
cnf(c_0_48,negated_conjecture,
~ subclass(unordered_pair(u,u),y),
inference(spm,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_49,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM071-1 : 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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Fri Aug 25 12:36:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 2.47/2.56 % Version : CSE_E---1.5
% 2.47/2.56 % Problem : theBenchmark.p
% 2.47/2.56 % Proof found
% 2.47/2.56 % SZS status Theorem for theBenchmark.p
% 2.47/2.56 % SZS output start Proof
% See solution above
% 2.47/2.56 % Total time : 1.960000 s
% 2.47/2.56 % SZS output end Proof
% 2.47/2.56 % Total time : 1.966000 s
%------------------------------------------------------------------------------