TSTP Solution File: NUM450+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM450+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:36:07 EDT 2022
% Result : Theorem 7.47s 2.41s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 7 unt; 0 nHn; 21 RR)
% Number of literals : 38 ( 11 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_175,hypothesis,
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,esk21_1(X1)),stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_175) ).
cnf(i_0_138,hypothesis,
stldt0(sbsmnsldt0(xS)) = cS2076,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_138) ).
cnf(i_0_140,hypothesis,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| X1 != sz10 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_140) ).
cnf(i_0_187,hypothesis,
( aInteger0(esk21_1(X1))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_187) ).
cnf(i_0_196,negated_conjecture,
( X1 = sz00
| ~ aInteger0(X1)
| ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,X1),stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_196) ).
cnf(i_0_186,hypothesis,
( esk21_1(X1) != sz00
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8bh_9hfn/lgb.p',i_0_186) ).
cnf(c_0_203,hypothesis,
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,esk21_1(X1)),stldt0(sbsmnsldt0(xS)))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
i_0_175 ).
cnf(c_0_204,hypothesis,
stldt0(sbsmnsldt0(xS)) = cS2076,
i_0_138 ).
cnf(c_0_205,hypothesis,
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| X1 != sz10 ),
i_0_140 ).
cnf(c_0_206,hypothesis,
( aInteger0(esk21_1(X1))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
i_0_187 ).
cnf(c_0_207,negated_conjecture,
( X1 = sz00
| ~ aInteger0(X1)
| ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,X1),stldt0(sbsmnsldt0(xS))) ),
i_0_196 ).
cnf(c_0_208,hypothesis,
( aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(X1,esk21_1(X1)),cS2076)
| ~ aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_204]),c_0_204]) ).
cnf(c_0_209,hypothesis,
aElementOf0(sz10,cS2076),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_204])]) ).
cnf(c_0_210,hypothesis,
( aInteger0(esk21_1(X1))
| ~ aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[c_0_206,c_0_204]) ).
cnf(c_0_211,hypothesis,
( esk21_1(X1) != sz00
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
i_0_186 ).
cnf(c_0_212,negated_conjecture,
( X1 = sz00
| ~ aInteger0(X1)
| ~ aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,X1),cS2076) ),
inference(rw,[status(thm)],[c_0_207,c_0_204]) ).
cnf(c_0_213,hypothesis,
aSubsetOf0(szAzrzSzezqlpdtcmdtrp0(sz10,esk21_1(sz10)),cS2076),
inference(spm,[status(thm)],[c_0_208,c_0_209]) ).
cnf(c_0_214,hypothesis,
aInteger0(esk21_1(sz10)),
inference(spm,[status(thm)],[c_0_210,c_0_209]) ).
cnf(c_0_215,hypothesis,
( esk21_1(X1) != sz00
| ~ aElementOf0(X1,cS2076) ),
inference(rw,[status(thm)],[c_0_211,c_0_204]) ).
cnf(c_0_216,negated_conjecture,
esk21_1(sz10) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]) ).
cnf(c_0_217,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_209])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM450+6 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : 600
% 0.12/0.33 % DateTime : Wed Jul 6 19:23:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.47/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.41 # No SInE strategy applied
% 7.47/2.41 # Trying AutoSched0 for 150 seconds
% 7.47/2.41 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.47/2.41 # and selection function SelectNewComplexAHP.
% 7.47/2.41 #
% 7.47/2.41 # Preprocessing time : 0.024 s
% 7.47/2.41 # Presaturation interreduction done
% 7.47/2.41
% 7.47/2.41 # Proof found!
% 7.47/2.41 # SZS status Theorem
% 7.47/2.41 # SZS output start CNFRefutation
% See solution above
% 7.47/2.41 # Training examples: 0 positive, 0 negative
% 7.47/2.41
% 7.47/2.41 # -------------------------------------------------
% 7.47/2.41 # User time : 0.029 s
% 7.47/2.41 # System time : 0.007 s
% 7.47/2.41 # Total time : 0.036 s
% 7.47/2.41 # Maximum resident set size: 7124 pages
% 7.47/2.41
%------------------------------------------------------------------------------