TSTP Solution File: SET715+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET715+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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:35:20 EDT 2023
% Result : Theorem 4.72s 4.82s
% Output : CNFRefutation 4.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 79
% Syntax : Number of formulae : 105 ( 5 unt; 73 typ; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 163 ( 67 ~; 64 |; 21 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 249 ( 69 >; 180 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-6 aty)
% Number of functors : 58 ( 58 usr; 4 con; 0-8 aty)
% Number of variables : 106 ( 0 sgn; 57 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subset: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
equal_set: ( $i * $i ) > $o ).
tff(decl_25,type,
power_set: $i > $i ).
tff(decl_26,type,
intersection: ( $i * $i ) > $i ).
tff(decl_27,type,
union: ( $i * $i ) > $i ).
tff(decl_28,type,
empty_set: $i ).
tff(decl_29,type,
difference: ( $i * $i ) > $i ).
tff(decl_30,type,
singleton: $i > $i ).
tff(decl_31,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_32,type,
sum: $i > $i ).
tff(decl_33,type,
product: $i > $i ).
tff(decl_34,type,
maps: ( $i * $i * $i ) > $o ).
tff(decl_35,type,
apply: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
compose_predicate: ( $i * $i * $i * $i * $i * $i ) > $o ).
tff(decl_37,type,
compose_function: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_38,type,
equal_maps: ( $i * $i * $i * $i ) > $o ).
tff(decl_39,type,
identity: ( $i * $i ) > $o ).
tff(decl_40,type,
injective: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
surjective: ( $i * $i * $i ) > $o ).
tff(decl_42,type,
one_to_one: ( $i * $i * $i ) > $o ).
tff(decl_43,type,
inverse_predicate: ( $i * $i * $i * $i ) > $o ).
tff(decl_44,type,
inverse_function: ( $i * $i * $i ) > $i ).
tff(decl_45,type,
image2: ( $i * $i ) > $i ).
tff(decl_46,type,
image3: ( $i * $i * $i ) > $i ).
tff(decl_47,type,
inverse_image2: ( $i * $i ) > $i ).
tff(decl_48,type,
inverse_image3: ( $i * $i * $i ) > $i ).
tff(decl_49,type,
increasing: ( $i * $i * $i * $i * $i ) > $o ).
tff(decl_50,type,
decreasing: ( $i * $i * $i * $i * $i ) > $o ).
tff(decl_51,type,
isomorphism: ( $i * $i * $i * $i * $i ) > $o ).
tff(decl_52,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk4_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_56,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_59,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_60,type,
esk9_8: ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_61,type,
esk10_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_62,type,
esk11_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_63,type,
esk12_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_64,type,
esk13_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_65,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_66,type,
esk15_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_67,type,
esk16_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_68,type,
esk17_2: ( $i * $i ) > $i ).
tff(decl_69,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
esk19_3: ( $i * $i * $i ) > $i ).
tff(decl_71,type,
esk20_3: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
esk21_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_73,type,
esk22_3: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
esk23_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_75,type,
esk24_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_76,type,
esk25_3: ( $i * $i * $i ) > $i ).
tff(decl_77,type,
esk26_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_78,type,
esk27_3: ( $i * $i * $i ) > $i ).
tff(decl_79,type,
esk28_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_80,type,
esk29_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_81,type,
esk30_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_82,type,
esk31_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_83,type,
esk32_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_84,type,
esk33_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_85,type,
esk34_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_86,type,
esk35_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_87,type,
esk36_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_88,type,
esk37_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_89,type,
esk38_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_90,type,
esk39_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_91,type,
esk40_5: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_92,type,
esk41_0: $i ).
tff(decl_93,type,
esk42_0: $i ).
tff(decl_94,type,
esk43_0: $i ).
fof(thII06,conjecture,
! [X6,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2) )
=> identity(compose_function(X6,inverse_function(X6,X1,X2),X2,X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII06) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',identity) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X6,X4,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(one_to_one,axiom,
! [X6,X1,X2] :
( one_to_one(X6,X1,X2)
<=> ( injective(X6,X1,X2)
& surjective(X6,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',one_to_one) ).
fof(inverse_function,axiom,
! [X6,X1,X2,X3,X5] :
( ( member(X3,X1)
& member(X5,X2) )
=> ( apply(X6,X3,X5)
<=> apply(inverse_function(X6,X1,X2),X5,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',inverse_function) ).
fof(c_0_6,negated_conjecture,
~ ! [X6,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2) )
=> identity(compose_function(X6,inverse_function(X6,X1,X2),X2,X1,X2),X2) ),
inference(assume_negation,[status(cth)],[thII06]) ).
fof(c_0_7,plain,
! [X113,X114,X115,X116,X117] :
( ( ~ identity(X113,X114)
| ~ member(X115,X114)
| apply(X113,X115,X115) )
& ( member(esk17_2(X116,X117),X117)
| identity(X116,X117) )
& ( ~ apply(X116,esk17_2(X116,X117),esk17_2(X116,X117))
| identity(X116,X117) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[identity])])])])])]) ).
fof(c_0_8,plain,
! [X90,X91,X92,X93,X94,X95,X96,X98] :
( ( member(esk13_7(X90,X91,X92,X93,X94,X95,X96),X93)
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( apply(X91,X95,esk13_7(X90,X91,X92,X93,X94,X95,X96))
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( apply(X90,esk13_7(X90,X91,X92,X93,X94,X95,X96),X96)
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( ~ member(X98,X93)
| ~ apply(X91,X95,X98)
| ~ apply(X90,X98,X96)
| apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])]) ).
fof(c_0_9,negated_conjecture,
( maps(esk41_0,esk42_0,esk43_0)
& one_to_one(esk41_0,esk42_0,esk43_0)
& ~ identity(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( identity(X1,X2)
| ~ apply(X1,esk17_2(X1,X2),esk17_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( apply(compose_function(X5,X3,X7,X2,X8),X4,X6)
| ~ member(X1,X2)
| ~ apply(X3,X4,X1)
| ~ apply(X5,X1,X6)
| ~ member(X4,X7)
| ~ member(X6,X8) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ identity(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( member(esk17_2(X1,X2),X2)
| identity(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X131,X132,X133,X134,X136,X137,X138,X140] :
( ( member(esk21_4(X131,X132,X133,X134),X132)
| ~ member(X134,X133)
| ~ surjective(X131,X132,X133) )
& ( apply(X131,esk21_4(X131,X132,X133,X134),X134)
| ~ member(X134,X133)
| ~ surjective(X131,X132,X133) )
& ( member(esk22_3(X136,X137,X138),X138)
| surjective(X136,X137,X138) )
& ( ~ member(X140,X137)
| ~ apply(X136,X140,esk22_3(X136,X137,X138))
| surjective(X136,X137,X138) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[surjective])])])])])]) ).
fof(c_0_15,plain,
! [X141,X142,X143] :
( ( injective(X141,X142,X143)
| ~ one_to_one(X141,X142,X143) )
& ( surjective(X141,X142,X143)
| ~ one_to_one(X141,X142,X143) )
& ( ~ injective(X141,X142,X143)
| ~ surjective(X141,X142,X143)
| one_to_one(X141,X142,X143) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_to_one])])]) ).
cnf(c_0_16,plain,
( identity(compose_function(X1,X2,X3,X4,X5),X6)
| ~ apply(X1,X7,esk17_2(compose_function(X1,X2,X3,X4,X5),X6))
| ~ apply(X2,esk17_2(compose_function(X1,X2,X3,X4,X5),X6),X7)
| ~ member(esk17_2(compose_function(X1,X2,X3,X4,X5),X6),X5)
| ~ member(esk17_2(compose_function(X1,X2,X3,X4,X5),X6),X3)
| ~ member(X7,X4) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
member(esk17_2(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0),esk43_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X156,X157,X158,X159,X160] :
( ( ~ apply(X156,X159,X160)
| apply(inverse_function(X156,X157,X158),X160,X159)
| ~ member(X159,X157)
| ~ member(X160,X158) )
& ( ~ apply(inverse_function(X156,X157,X158),X160,X159)
| apply(X156,X159,X160)
| ~ member(X159,X157)
| ~ member(X160,X158) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inverse_function])])]) ).
cnf(c_0_19,plain,
( apply(X1,esk21_4(X1,X2,X3,X4),X4)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( surjective(X1,X2,X3)
| ~ one_to_one(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ apply(inverse_function(esk41_0,esk42_0,esk43_0),esk17_2(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0),X1)
| ~ apply(esk41_0,X1,esk17_2(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0))
| ~ member(X1,esk42_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( apply(inverse_function(X1,X4,X5),X3,X2)
| ~ apply(X1,X2,X3)
| ~ member(X2,X4)
| ~ member(X3,X5) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( apply(X1,esk21_4(X1,X2,X3,X4),X4)
| ~ one_to_one(X1,X2,X3)
| ~ member(X4,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
one_to_one(esk41_0,esk42_0,esk43_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( member(esk21_4(X1,X2,X3,X4),X2)
| ~ member(X4,X3)
| ~ surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( ~ apply(esk41_0,X1,esk17_2(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0))
| ~ member(X1,esk42_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
( apply(esk41_0,esk21_4(esk41_0,esk42_0,esk43_0,X1),X1)
| ~ member(X1,esk43_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( member(esk21_4(X1,X2,X3,X4),X2)
| ~ one_to_one(X1,X2,X3)
| ~ member(X4,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
~ member(esk21_4(esk41_0,esk42_0,esk43_0,esk17_2(compose_function(esk41_0,inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0,esk43_0),esk43_0)),esk42_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
( member(esk21_4(esk41_0,esk42_0,esk43_0,X1),esk42_0)
| ~ member(X1,esk43_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET715+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 14:42:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 4.72/4.82 % Version : CSE_E---1.5
% 4.72/4.82 % Problem : theBenchmark.p
% 4.72/4.82 % Proof found
% 4.72/4.82 % SZS status Theorem for theBenchmark.p
% 4.72/4.82 % SZS output start Proof
% See solution above
% 4.72/4.83 % Total time : 4.257000 s
% 4.72/4.83 % SZS output end Proof
% 4.72/4.83 % Total time : 4.261000 s
%------------------------------------------------------------------------------