TSTP Solution File: NUM571+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM571+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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:38:51 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 59
% Syntax : Number of formulae : 73 ( 5 unt; 55 typ; 0 def)
% Number of atoms : 55 ( 16 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 52 ( 15 ~; 16 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 44 >; 41 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 46 ( 46 usr; 11 con; 0-4 aty)
% Number of variables : 3 ( 0 sgn; 2 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aSet0: $i > $o ).
tff(decl_23,type,
aElement0: $i > $o ).
tff(decl_24,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_25,type,
isFinite0: $i > $o ).
tff(decl_26,type,
slcrc0: $i ).
tff(decl_27,type,
isCountable0: $i > $o ).
tff(decl_28,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(decl_29,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_30,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(decl_31,type,
szNzAzT0: $i ).
tff(decl_32,type,
sz00: $i ).
tff(decl_33,type,
szszuzczcdt0: $i > $i ).
tff(decl_34,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(decl_35,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_36,type,
sbrdtbr0: $i > $i ).
tff(decl_37,type,
szmzizndt0: $i > $i ).
tff(decl_38,type,
szmzazxdt0: $i > $i ).
tff(decl_39,type,
slbdtrb0: $i > $i ).
tff(decl_40,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff(decl_41,type,
aFunction0: $i > $o ).
tff(decl_42,type,
szDzozmdt0: $i > $i ).
tff(decl_43,type,
sdtlpdtrp0: ( $i * $i ) > $i ).
tff(decl_44,type,
sdtlbdtrb0: ( $i * $i ) > $i ).
tff(decl_45,type,
sdtlcdtrc0: ( $i * $i ) > $i ).
tff(decl_46,type,
sdtexdt0: ( $i * $i ) > $i ).
tff(decl_47,type,
szDzizrdt0: $i > $i ).
tff(decl_48,type,
xT: $i ).
tff(decl_49,type,
xK: $i ).
tff(decl_50,type,
xS: $i ).
tff(decl_51,type,
xc: $i ).
tff(decl_52,type,
xk: $i ).
tff(decl_53,type,
xN: $i ).
tff(decl_54,type,
xi: $i ).
tff(decl_55,type,
esk1_1: $i > $i ).
tff(decl_56,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_58,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_59,type,
esk5_1: $i > $i ).
tff(decl_60,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_62,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk10_1: $i > $i ).
tff(decl_65,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_66,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_67,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_68,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_69,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_71,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
esk18_2: ( $i * $i ) > $i ).
tff(decl_73,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_74,type,
esk20_3: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
esk21_3: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
esk22_0: $i ).
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3702_02,hypothesis,
( xi != sz00
=> ( ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xi )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3702_02) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(c_0_4,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_6,hypothesis,
( ( aElementOf0(esk22_0,szNzAzT0)
| xi = sz00 )
& ( szszuzczcdt0(esk22_0) = xi
| xi = sz00 )
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| xi = sz00 )
& ( isCountable0(sdtlpdtrp0(xN,xi))
| xi = sz00 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3702_02])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
( isCountable0(sdtlpdtrp0(xN,xi))
| xi = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| xi = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( xi = sz00
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
xi = sz00,
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_12,hypothesis,
! [X174] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X174)),sdtmndt0(sdtlpdtrp0(xN,X174),szmzizndt0(sdtlpdtrp0(xN,X174))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X174)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X174),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X174))
| ~ aElementOf0(X174,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,sz00)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_16,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM571+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 12:56:08 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.033000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.036000 s
%------------------------------------------------------------------------------