TSTP Solution File: SEU368+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU368+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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 16:25:10 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 49
% Syntax : Number of formulae : 80 ( 18 unt; 41 typ; 0 def)
% Number of atoms : 79 ( 38 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 20 |; 15 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 32 >; 13 *; 0 +; 0 <<)
% Number of predicates : 20 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 9 con; 0-2 aty)
% Number of variables : 56 ( 6 sgn; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
one_sorted_str: $i > $o ).
tff(decl_24,type,
empty_carrier: $i > $o ).
tff(decl_25,type,
the_carrier: $i > $i ).
tff(decl_26,type,
empty: $i > $o ).
tff(decl_27,type,
powerset: $i > $i ).
tff(decl_28,type,
element: ( $i * $i ) > $o ).
tff(decl_29,type,
rel_str: $i > $o ).
tff(decl_30,type,
strict_rel_str: $i > $o ).
tff(decl_31,type,
reflexive_relstr: $i > $o ).
tff(decl_32,type,
transitive_relstr: $i > $o ).
tff(decl_33,type,
antisymmetric_relstr: $i > $o ).
tff(decl_34,type,
empty_set: $i ).
tff(decl_35,type,
subset: ( $i * $i ) > $o ).
tff(decl_36,type,
incl_POSet: $i > $i ).
tff(decl_37,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff(decl_38,type,
rel_str_of: ( $i * $i ) > $i ).
tff(decl_39,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_40,type,
reflexive: $i > $o ).
tff(decl_41,type,
antisymmetric: $i > $o ).
tff(decl_42,type,
transitive: $i > $o ).
tff(decl_43,type,
v1_partfun1: ( $i * $i * $i ) > $o ).
tff(decl_44,type,
relation: $i > $o ).
tff(decl_45,type,
the_InternalRel: $i > $i ).
tff(decl_46,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff(decl_47,type,
inclusion_relation: $i > $i ).
tff(decl_48,type,
inclusion_order: $i > $i ).
tff(decl_49,type,
esk1_0: $i ).
tff(decl_50,type,
esk2_1: $i > $i ).
tff(decl_51,type,
esk3_0: $i ).
tff(decl_52,type,
esk4_1: $i > $i ).
tff(decl_53,type,
esk5_1: $i > $i ).
tff(decl_54,type,
esk6_0: $i ).
tff(decl_55,type,
esk7_0: $i ).
tff(decl_56,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk9_1: $i > $i ).
tff(decl_58,type,
esk10_0: $i ).
tff(decl_59,type,
esk11_0: $i ).
tff(decl_60,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk13_0: $i ).
tff(decl_62,type,
esk14_0: $i ).
fof(dt_k1_yellow_1,axiom,
! [X1] :
( reflexive(inclusion_order(X1))
& antisymmetric(inclusion_order(X1))
& transitive(inclusion_order(X1))
& v1_partfun1(inclusion_order(X1),X1,X1)
& relation_of2_as_subset(inclusion_order(X1),X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_yellow_1) ).
fof(redefinition_k1_yellow_1,axiom,
! [X1] : inclusion_order(X1) = inclusion_relation(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k1_yellow_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(d1_yellow_1,axiom,
! [X1] : incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_yellow_1) ).
fof(t1_yellow_1,conjecture,
! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_yellow_1) ).
fof(free_g1_orders_2,axiom,
! [X1,X2] :
( relation_of2(X2,X1,X1)
=> ! [X3,X4] :
( rel_str_of(X1,X2) = rel_str_of(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',free_g1_orders_2) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_yellow_1) ).
fof(abstractness_v1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ( strict_rel_str(X1)
=> X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstractness_v1_orders_2) ).
fof(c_0_8,plain,
! [X75] :
( reflexive(inclusion_order(X75))
& antisymmetric(inclusion_order(X75))
& transitive(inclusion_order(X75))
& v1_partfun1(inclusion_order(X75),X75,X75)
& relation_of2_as_subset(inclusion_order(X75),X75,X75) ),
inference(variable_rename,[status(thm)],[dt_k1_yellow_1]) ).
fof(c_0_9,plain,
! [X74] : inclusion_order(X74) = inclusion_relation(X74),
inference(variable_rename,[status(thm)],[redefinition_k1_yellow_1]) ).
fof(c_0_10,plain,
! [X62,X63,X64] :
( ( ~ relation_of2_as_subset(X64,X62,X63)
| relation_of2(X64,X62,X63) )
& ( ~ relation_of2(X64,X62,X63)
| relation_of2_as_subset(X64,X62,X63) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_11,plain,
relation_of2_as_subset(inclusion_order(X1),X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
inclusion_order(X1) = inclusion_relation(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X79] : incl_POSet(X79) = rel_str_of(X79,inclusion_order(X79)),
inference(variable_rename,[status(thm)],[d1_yellow_1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
inference(assume_negation,[status(cth)],[t1_yellow_1]) ).
fof(c_0_15,plain,
! [X52,X53,X54,X55] :
( ( X52 = X54
| rel_str_of(X52,X53) != rel_str_of(X54,X55)
| ~ relation_of2(X53,X52,X52) )
& ( X53 = X55
| rel_str_of(X52,X53) != rel_str_of(X54,X55)
| ~ relation_of2(X53,X52,X52) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[free_g1_orders_2])])])]) ).
cnf(c_0_16,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
relation_of2_as_subset(inclusion_relation(X1),X1,X1),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_18,plain,
! [X76] :
( strict_rel_str(incl_POSet(X76))
& rel_str(incl_POSet(X76)) ),
inference(variable_rename,[status(thm)],[dt_k2_yellow_1]) ).
cnf(c_0_19,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_order(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
( the_carrier(incl_POSet(esk14_0)) != esk14_0
| the_InternalRel(incl_POSet(esk14_0)) != inclusion_order(esk14_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_21,plain,
( X1 = X2
| rel_str_of(X1,X3) != rel_str_of(X2,X4)
| ~ relation_of2(X3,X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
relation_of2(inclusion_relation(X1),X1,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_23,plain,
! [X56] :
( ~ rel_str(X56)
| ~ strict_rel_str(X56)
| X56 = rel_str_of(the_carrier(X56),the_InternalRel(X56)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[abstractness_v1_orders_2])]) ).
cnf(c_0_24,plain,
strict_rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
incl_POSet(X1) = rel_str_of(X1,inclusion_relation(X1)),
inference(rw,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_26,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( the_carrier(incl_POSet(esk14_0)) != esk14_0
| the_InternalRel(incl_POSet(esk14_0)) != inclusion_order(esk14_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( X1 = X2
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( X1 = rel_str_of(the_carrier(X1),the_InternalRel(X1))
| ~ rel_str(X1)
| ~ strict_rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
strict_rel_str(rel_str_of(X1,inclusion_relation(X1))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
rel_str(rel_str_of(X1,inclusion_relation(X1))),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_32,plain,
( X1 = X2
| rel_str_of(X3,X1) != rel_str_of(X4,X2)
| ~ relation_of2(X1,X3,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( the_carrier(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != esk14_0
| the_InternalRel(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != inclusion_relation(esk14_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_12]),c_0_25]),c_0_25]) ).
cnf(c_0_34,plain,
the_carrier(rel_str_of(X1,inclusion_relation(X1))) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]),c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( inclusion_relation(X1) = X2
| rel_str_of(X1,inclusion_relation(X1)) != rel_str_of(X3,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_36,negated_conjecture,
the_InternalRel(rel_str_of(esk14_0,inclusion_relation(esk14_0))) != inclusion_relation(esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,plain,
the_InternalRel(rel_str_of(X1,inclusion_relation(X1))) = inclusion_relation(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29])]),c_0_30]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU368+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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 : Wed Aug 23 18:18:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.014000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.018000 s
%------------------------------------------------------------------------------