TSTP Solution File: NUM566+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM566+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : 600s
% DateTime : Mon Jul 18 08:37:26 EDT 2022
% Result : Theorem 6.73s 3.19s
% Output : CNFRefutation 6.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 15 unt; 0 nHn; 40 RR)
% Number of literals : 88 ( 19 equ; 54 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_154,hypothesis,
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| sdtlpdtrp0(xc,X2) != X1
| ~ aElementOf0(X2,szDzozmdt0(xc)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_154) ).
cnf(i_0_158,hypothesis,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_158) ).
cnf(i_0_4136,hypothesis,
xK = sz00,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4136) ).
cnf(i_0_153,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_153) ).
cnf(i_0_4142,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4142) ).
cnf(i_0_4137,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4137) ).
cnf(i_0_4154,negated_conjecture,
( sdtlpdtrp0(xc,esk33_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4154) ).
cnf(i_0_159,hypothesis,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_159) ).
cnf(i_0_4156,negated_conjecture,
( sbrdtbr0(esk33_2(X1,X2)) = xK
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4156) ).
cnf(i_0_4157,negated_conjecture,
( aSubsetOf0(esk33_2(X1,X2),X2)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_4157) ).
cnf(i_0_148,hypothesis,
isCountable0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_148) ).
cnf(i_0_17,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_17) ).
cnf(i_0_151,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5usas5ir/lgb.p',i_0_151) ).
cnf(c_0_4171,hypothesis,
( aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))
| sdtlpdtrp0(xc,X2) != X1
| ~ aElementOf0(X2,szDzozmdt0(xc)) ),
i_0_154 ).
cnf(c_0_4172,hypothesis,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
i_0_158 ).
cnf(c_0_4173,hypothesis,
xK = sz00,
i_0_4136 ).
cnf(c_0_4174,hypothesis,
( aElementOf0(X1,xT)
| ~ aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc))) ),
i_0_153 ).
cnf(c_0_4175,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),sdtlcdtrc0(xc,szDzozmdt0(xc)))
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(er,[status(thm)],[c_0_4171]) ).
cnf(c_0_4176,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,slbdtsldtrb0(xS,sz00)) ),
i_0_4142 ).
cnf(c_0_4177,hypothesis,
slbdtsldtrb0(xS,sz00) = szDzozmdt0(xc),
inference(rw,[status(thm)],[c_0_4172,c_0_4173]) ).
cnf(c_0_4178,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,X1),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[c_0_4174,c_0_4175]) ).
cnf(c_0_4179,hypothesis,
( sdtlpdtrp0(xc,X1) = sdtlpdtrp0(xc,slcrc0)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(rw,[status(thm)],[c_0_4176,c_0_4177]) ).
cnf(c_0_4180,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xS,sz00)),
i_0_4137 ).
cnf(c_0_4181,hypothesis,
( aElementOf0(sdtlpdtrp0(xc,slcrc0),xT)
| ~ aElementOf0(X1,szDzozmdt0(xc)) ),
inference(spm,[status(thm)],[c_0_4178,c_0_4179]) ).
cnf(c_0_4182,hypothesis,
aElementOf0(slcrc0,szDzozmdt0(xc)),
inference(rw,[status(thm)],[c_0_4180,c_0_4177]) ).
cnf(c_0_4183,negated_conjecture,
( sdtlpdtrp0(xc,esk33_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4154 ).
cnf(c_0_4184,hypothesis,
aElementOf0(sdtlpdtrp0(xc,slcrc0),xT),
inference(spm,[status(thm)],[c_0_4181,c_0_4182]) ).
cnf(c_0_4185,hypothesis,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xS) ),
i_0_159 ).
cnf(c_0_4186,hypothesis,
( ~ isCountable0(X1)
| ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(esk33_2(sdtlpdtrp0(xc,slcrc0),X1),szDzozmdt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4183,c_0_4179])]),c_0_4184])]) ).
cnf(c_0_4187,hypothesis,
( aElementOf0(X1,szDzozmdt0(xc))
| sbrdtbr0(X1) != sz00
| ~ aSubsetOf0(X1,xS) ),
inference(rw,[status(thm)],[c_0_4185,c_0_4173]) ).
cnf(c_0_4188,negated_conjecture,
( sbrdtbr0(esk33_2(X1,X2)) = xK
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4156 ).
cnf(c_0_4189,hypothesis,
( sbrdtbr0(esk33_2(sdtlpdtrp0(xc,slcrc0),X1)) != sz00
| ~ isCountable0(X1)
| ~ aSubsetOf0(esk33_2(sdtlpdtrp0(xc,slcrc0),X1),xS)
| ~ aSubsetOf0(X1,xS) ),
inference(spm,[status(thm)],[c_0_4186,c_0_4187]) ).
cnf(c_0_4190,negated_conjecture,
( sbrdtbr0(esk33_2(X1,X2)) = sz00
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| ~ aElementOf0(X1,xT) ),
inference(rw,[status(thm)],[c_0_4188,c_0_4173]) ).
cnf(c_0_4191,negated_conjecture,
( ~ isCountable0(X1)
| ~ aSubsetOf0(esk33_2(sdtlpdtrp0(xc,slcrc0),X1),xS)
| ~ aSubsetOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4189,c_0_4190]),c_0_4184])]) ).
cnf(c_0_4192,negated_conjecture,
( aSubsetOf0(esk33_2(X1,X2),X2)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4157 ).
cnf(c_0_4193,hypothesis,
isCountable0(xS),
i_0_148 ).
cnf(c_0_4194,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4191,c_0_4192]),c_0_4193]),c_0_4184])]) ).
cnf(c_0_4195,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
i_0_17 ).
cnf(c_0_4196,hypothesis,
aSet0(xS),
i_0_151 ).
cnf(c_0_4197,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4194,c_0_4195]),c_0_4196])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM566+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 16:40:30 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 6.73/3.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.73/3.19 # No SInE strategy applied
% 6.73/3.19 # Trying AutoSched0 for 150 seconds
% 6.73/3.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.73/3.19 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.73/3.19 #
% 6.73/3.19 # Preprocessing time : 0.026 s
% 6.73/3.19 # Presaturation interreduction done
% 6.73/3.19
% 6.73/3.19 # Proof found!
% 6.73/3.19 # SZS status Theorem
% 6.73/3.19 # SZS output start CNFRefutation
% See solution above
% 6.73/3.20 # Training examples: 0 positive, 0 negative
% 6.73/3.20
% 6.73/3.20 # -------------------------------------------------
% 6.73/3.20 # User time : 0.038 s
% 6.73/3.20 # System time : 0.010 s
% 6.73/3.20 # Total time : 0.049 s
% 6.73/3.20 # Maximum resident set size: 7124 pages
% 6.73/3.20
%------------------------------------------------------------------------------