TSTP Solution File: NUM633+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM633+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 : n002.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:39:32 EDT 2023
% Result : Theorem 0.19s 0.65s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 66
% Syntax : Number of formulae : 79 ( 7 unt; 62 typ; 0 def)
% Number of atoms : 61 ( 13 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 71 ( 27 ~; 19 |; 19 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 91 ( 49 >; 42 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 53 ( 53 usr; 13 con; 0-4 aty)
% Number of variables : 18 ( 0 sgn; 7 !; 4 ?; 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,
xC: $i ).
tff(decl_55,type,
xe: $i ).
tff(decl_56,type,
xd: $i ).
tff(decl_57,type,
xO: $i ).
tff(decl_58,type,
esk1_1: $i > $i ).
tff(decl_59,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_61,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_62,type,
esk5_1: $i > $i ).
tff(decl_63,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_65,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_66,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk10_1: $i > $i ).
tff(decl_68,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_69,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_71,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_72,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_73,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
esk18_2: ( $i * $i ) > $i ).
tff(decl_76,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_77,type,
esk20_3: ( $i * $i * $i ) > $i ).
tff(decl_78,type,
esk21_3: ( $i * $i * $i ) > $i ).
tff(decl_79,type,
esk22_1: $i > $i ).
tff(decl_80,type,
esk23_1: $i > $i ).
tff(decl_81,type,
esk24_1: $i > $i ).
tff(decl_82,type,
esk25_1: $i > $i ).
tff(decl_83,type,
esk26_2: ( $i * $i ) > $i ).
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).
fof(m__4908,hypothesis,
( aSet0(xO)
& isCountable0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
fof(m__4854,hypothesis,
( aElementOf0(szDzizrdt0(xd),xT)
& isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( X1 != slcrc0
& aSubsetOf0(X1,szNzAzT0)
& aElementOf0(X1,szDzozmdt0(xc))
& sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ) )
=> ? [X1] :
( aElementOf0(X1,xT)
& ? [X2] :
( aSubsetOf0(X2,xS)
& isCountable0(X2)
& ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 ) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
! [X200,X201,X202] :
( ( X200 != slcrc0
| ~ aElementOf0(X200,slbdtsldtrb0(xO,xK)) )
& ( aSubsetOf0(X200,szNzAzT0)
| ~ aElementOf0(X200,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(X200,szDzozmdt0(xc))
| ~ aElementOf0(X200,slbdtsldtrb0(xO,xK)) )
& ( sdtlpdtrp0(xc,X200) = szDzizrdt0(xd)
| ~ aElementOf0(X200,slbdtsldtrb0(xO,xK)) )
& ( aElementOf0(esk26_2(X201,X202),slbdtsldtrb0(X202,xK))
| ~ aSubsetOf0(X202,xS)
| ~ isCountable0(X202)
| ~ aElementOf0(X201,xT) )
& ( sdtlpdtrp0(xc,esk26_2(X201,X202)) != X201
| ~ aSubsetOf0(X202,xS)
| ~ isCountable0(X202)
| ~ aElementOf0(X201,xT) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_6,negated_conjecture,
( aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_8,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
cnf(c_0_9,negated_conjecture,
( sdtlpdtrp0(xc,esk26_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xS)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
( aElementOf0(esk26_2(X1,xO),slbdtsldtrb0(xO,xK))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[m__4854]) ).
cnf(c_0_12,hypothesis,
( sdtlpdtrp0(xc,esk26_2(X1,xO)) != X1
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_8])]) ).
cnf(c_0_13,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,hypothesis,
aElementOf0(esk26_2(szDzizrdt0(xd),xO),slbdtsldtrb0(xO,xK)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
sdtlpdtrp0(xc,esk26_2(szDzizrdt0(xd),xO)) != szDzizrdt0(xd),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM633+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 12:03:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.65 % Version : CSE_E---1.5
% 0.19/0.65 % Problem : theBenchmark.p
% 0.19/0.65 % Proof found
% 0.19/0.65 % SZS status Theorem for theBenchmark.p
% 0.19/0.65 % SZS output start Proof
% See solution above
% 0.19/0.66 % Total time : 0.088000 s
% 0.19/0.66 % SZS output end Proof
% 0.19/0.66 % Total time : 0.092000 s
%------------------------------------------------------------------------------