TSTP Solution File: NUM610+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM610+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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:14 EDT 2023
% Result : Theorem 0.20s 0.70s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 70
% Syntax : Number of formulae : 82 ( 8 unt; 64 typ; 0 def)
% Number of atoms : 59 ( 2 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 70 ( 29 ~; 27 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 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 : 22 ( 0 sgn; 13 !; 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(mSubTrans,axiom,
! [X1,X2,X3] :
( ( aSet0(X1)
& aSet0(X2)
& aSet0(X3) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X2,X3) )
=> aSubsetOf0(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__5093,hypothesis,
( aSubsetOf0(xQ,xO)
& xQ != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4891) ).
fof(m__,conjecture,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5195,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(c_0_6,plain,
! [X25,X26,X27] :
( ~ aSet0(X25)
| ~ aSet0(X26)
| ~ aSet0(X27)
| ~ aSubsetOf0(X25,X26)
| ~ aSubsetOf0(X26,X27)
| aSubsetOf0(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubTrans])]) ).
fof(c_0_7,plain,
! [X15,X16,X17,X18] :
( ( aSet0(X16)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(X17,X16)
| aElementOf0(X17,X15)
| ~ aSubsetOf0(X16,X15)
| ~ aSet0(X15) )
& ( aElementOf0(esk2_2(X15,X18),X18)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) )
& ( ~ aElementOf0(esk2_2(X15,X18),X15)
| ~ aSet0(X18)
| aSubsetOf0(X18,X15)
| ~ aSet0(X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])]) ).
cnf(c_0_8,plain,
( aSubsetOf0(X1,X3)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[m__5093]) ).
cnf(c_0_12,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
fof(c_0_13,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_14,hypothesis,
( aSubsetOf0(X1,xO)
| ~ aSubsetOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[m__5195]) ).
cnf(c_0_16,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM610+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.34 % Computer : n013.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Fri Aug 25 13:06:32 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.63 start to proof: theBenchmark
% 0.20/0.70 % Version : CSE_E---1.5
% 0.20/0.70 % Problem : theBenchmark.p
% 0.20/0.70 % Proof found
% 0.20/0.70 % SZS status Theorem for theBenchmark.p
% 0.20/0.70 % SZS output start Proof
% See solution above
% 0.20/0.71 % Total time : 0.068000 s
% 0.20/0.71 % SZS output end Proof
% 0.20/0.71 % Total time : 0.074000 s
%------------------------------------------------------------------------------