TSTP Solution File: NUM633+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM633+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:38:08 EDT 2022
% Result : Theorem 9.20s 3.55s
% Output : CNFRefutation 9.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 17 RR)
% Number of literals : 42 ( 10 equ; 29 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4247,negated_conjecture,
( sdtlpdtrp0(xc,esk43_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4247) ).
cnf(i_0_4275,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xO) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4275) ).
cnf(i_0_4225,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4225) ).
cnf(i_0_4250,negated_conjecture,
( aSubsetOf0(esk43_2(X1,X2),X2)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4250) ).
cnf(i_0_4245,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4245) ).
cnf(i_0_4235,hypothesis,
isCountable0(xO),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4235) ).
cnf(i_0_4249,negated_conjecture,
( sbrdtbr0(esk43_2(X1,X2)) = xK
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zbzl14du/lgb.p',i_0_4249) ).
cnf(c_0_4283,negated_conjecture,
( sdtlpdtrp0(xc,esk43_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4247 ).
cnf(c_0_4284,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| sbrdtbr0(X1) != xK
| ~ aSubsetOf0(X1,xO) ),
i_0_4275 ).
cnf(c_0_4285,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
i_0_4225 ).
cnf(c_0_4286,negated_conjecture,
( sbrdtbr0(esk43_2(szDzizrdt0(xd),X1)) != xK
| ~ aSubsetOf0(esk43_2(szDzizrdt0(xd),X1),xO)
| ~ aSubsetOf0(X1,xS)
| ~ isCountable0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4283,c_0_4284])]),c_0_4285])]) ).
cnf(c_0_4287,negated_conjecture,
( aSubsetOf0(esk43_2(X1,X2),X2)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4250 ).
cnf(c_0_4288,hypothesis,
aSubsetOf0(xO,xS),
i_0_4245 ).
cnf(c_0_4289,hypothesis,
isCountable0(xO),
i_0_4235 ).
cnf(c_0_4290,negated_conjecture,
sbrdtbr0(esk43_2(szDzizrdt0(xd),xO)) != xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4286,c_0_4287]),c_0_4288]),c_0_4289]),c_0_4285])]) ).
cnf(c_0_4291,negated_conjecture,
( sbrdtbr0(esk43_2(X1,X2)) = xK
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_4249 ).
cnf(c_0_4292,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4290,c_0_4291]),c_0_4288]),c_0_4285]),c_0_4289])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM633+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 13:08:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 9.20/3.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.20/3.55 # No SInE strategy applied
% 9.20/3.55 # Trying AutoSched0 for 150 seconds
% 9.20/3.55 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.20/3.55 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.20/3.55 #
% 9.20/3.55 # Preprocessing time : 0.025 s
% 9.20/3.55
% 9.20/3.55 # Proof found!
% 9.20/3.55 # SZS status Theorem
% 9.20/3.55 # SZS output start CNFRefutation
% See solution above
% 9.20/3.55 # Training examples: 0 positive, 0 negative
% 9.20/3.55
% 9.20/3.55 # -------------------------------------------------
% 9.20/3.55 # User time : 0.035 s
% 9.20/3.55 # System time : 0.005 s
% 9.20/3.55 # Total time : 0.040 s
% 9.20/3.55 # Maximum resident set size: 7120 pages
% 9.20/3.55
%------------------------------------------------------------------------------