TSTP Solution File: NUM613+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM613+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 : n032.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:17 EDT 2023
% Result : Theorem 0.14s 0.54s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 68
% Syntax : Number of formulae : 81 ( 11 unt; 64 typ; 0 def)
% Number of atoms : 31 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 10 ~; 8 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 89 ( 48 >; 41 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 55 ( 55 usr; 16 con; 0-4 aty)
% Number of variables : 7 ( 0 sgn; 4 !; 0 ?; 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,
xQ: $i ).
tff(decl_59,type,
xp: $i ).
tff(decl_60,type,
xP: $i ).
tff(decl_61,type,
esk1_1: $i > $i ).
tff(decl_62,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_64,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_65,type,
esk5_1: $i > $i ).
tff(decl_66,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_69,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_70,type,
esk10_1: $i > $i ).
tff(decl_71,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_73,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
esk14_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_75,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_77,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_78,type,
esk18_2: ( $i * $i ) > $i ).
tff(decl_79,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_80,type,
esk20_3: ( $i * $i * $i ) > $i ).
tff(decl_81,type,
esk21_3: ( $i * $i * $i ) > $i ).
tff(decl_82,type,
esk22_1: $i > $i ).
tff(decl_83,type,
esk23_1: $i > $i ).
tff(decl_84,type,
esk24_1: $i > $i ).
tff(decl_85,type,
esk25_1: $i > $i ).
fof(mSuccEquSucc,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( szszuzczcdt0(X1) = szszuzczcdt0(X2)
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccEquSucc) ).
fof(m__5255,hypothesis,
( sbrdtbr0(xQ) = szszuzczcdt0(xk)
& szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
& aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5255) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3533) ).
fof(m__,conjecture,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(c_0_4,plain,
! [X55,X56] :
( ~ aElementOf0(X55,szNzAzT0)
| ~ aElementOf0(X56,szNzAzT0)
| szszuzczcdt0(X55) != szszuzczcdt0(X56)
| X55 = X56 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccEquSucc])]) ).
cnf(c_0_5,hypothesis,
sbrdtbr0(xQ) = szszuzczcdt0(xk),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_6,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| szszuzczcdt0(X1) != szszuzczcdt0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_9,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_10,hypothesis,
sbrdtbr0(xQ) = xK,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
fof(c_0_11,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_12,hypothesis,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).
cnf(c_0_13,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5255]) ).
cnf(c_0_15,negated_conjecture,
sbrdtbr0(xP) != xk,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM613+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Fri Aug 25 13:39:58 EDT 2023
% 0.10/0.29 % CPUTime :
% 0.14/0.48 start to proof: theBenchmark
% 0.14/0.54 % Version : CSE_E---1.5
% 0.14/0.54 % Problem : theBenchmark.p
% 0.14/0.54 % Proof found
% 0.14/0.54 % SZS status Theorem for theBenchmark.p
% 0.14/0.54 % SZS output start Proof
% See solution above
% 0.14/0.54 % Total time : 0.050000 s
% 0.14/0.54 % SZS output end Proof
% 0.14/0.54 % Total time : 0.054000 s
%------------------------------------------------------------------------------