TSTP Solution File: NUM393+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM393+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:37:11 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 34
% Syntax : Number of formulae : 52 ( 7 unt; 30 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 65 ( 24 ~; 26 |; 7 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 16 >; 5 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 14 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
function: $i > $o ).
tff(decl_25,type,
ordinal: $i > $o ).
tff(decl_26,type,
epsilon_transitive: $i > $o ).
tff(decl_27,type,
epsilon_connected: $i > $o ).
tff(decl_28,type,
relation: $i > $o ).
tff(decl_29,type,
one_to_one: $i > $o ).
tff(decl_30,type,
ordinal_subset: ( $i * $i ) > $o ).
tff(decl_31,type,
inclusion_comparable: ( $i * $i ) > $o ).
tff(decl_32,type,
subset: ( $i * $i ) > $o ).
tff(decl_33,type,
element: ( $i * $i ) > $o ).
tff(decl_34,type,
empty_set: $i ).
tff(decl_35,type,
relation_empty_yielding: $i > $o ).
tff(decl_36,type,
relation_non_empty: $i > $o ).
tff(decl_37,type,
powerset: $i > $i ).
tff(decl_38,type,
esk1_1: $i > $i ).
tff(decl_39,type,
esk2_0: $i ).
tff(decl_40,type,
esk3_0: $i ).
tff(decl_41,type,
esk4_0: $i ).
tff(decl_42,type,
esk5_0: $i ).
tff(decl_43,type,
esk6_0: $i ).
tff(decl_44,type,
esk7_0: $i ).
tff(decl_45,type,
esk8_0: $i ).
tff(decl_46,type,
esk9_0: $i ).
tff(decl_47,type,
esk10_0: $i ).
tff(decl_48,type,
esk11_0: $i ).
tff(decl_49,type,
esk12_0: $i ).
tff(decl_50,type,
esk13_0: $i ).
tff(decl_51,type,
esk14_0: $i ).
fof(t25_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(d9_xboole_0,axiom,
! [X1,X2] :
( inclusion_comparable(X1,X2)
<=> ( subset(X1,X2)
| subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> inclusion_comparable(X1,X2) ) ),
inference(assume_negation,[status(cth)],[t25_ordinal1]) ).
fof(c_0_5,plain,
! [X11,X12] :
( ~ ordinal(X11)
| ~ ordinal(X12)
| ordinal_subset(X11,X12)
| ordinal_subset(X12,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
fof(c_0_6,negated_conjecture,
( ordinal(esk13_0)
& ordinal(esk14_0)
& ~ inclusion_comparable(esk13_0,esk14_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
ordinal(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X13,X14] :
( ( ~ inclusion_comparable(X13,X14)
| subset(X13,X14)
| subset(X14,X13) )
& ( ~ subset(X13,X14)
| inclusion_comparable(X13,X14) )
& ( ~ subset(X14,X13)
| inclusion_comparable(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_xboole_0])])]) ).
fof(c_0_10,plain,
! [X28,X29] :
( ( ~ ordinal_subset(X28,X29)
| subset(X28,X29)
| ~ ordinal(X28)
| ~ ordinal(X29) )
& ( ~ subset(X28,X29)
| ordinal_subset(X28,X29)
| ~ ordinal(X28)
| ~ ordinal(X29) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_11,negated_conjecture,
( ordinal_subset(X1,esk14_0)
| ordinal_subset(esk14_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
ordinal(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
~ inclusion_comparable(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( inclusion_comparable(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ordinal_subset(esk14_0,esk13_0)
| ordinal_subset(esk13_0,esk14_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ subset(esk14_0,esk13_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
ordinal_subset(esk13_0,esk14_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_8])]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ subset(esk13_0,esk14_0),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_8]),c_0_12])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM393+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n010.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 : Fri Aug 25 10:43:05 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.009000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.012000 s
%------------------------------------------------------------------------------