TSTP Solution File: NUM629+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM629+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:05 EDT 2022
% Result : Theorem 9.10s 3.59s
% Output : CNFRefutation 9.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 9 unt; 0 nHn; 20 RR)
% Number of literals : 38 ( 2 equ; 20 neg)
% Maximal clause size : 5 ( 1 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4142,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aElementOf0(X2,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4142) ).
cnf(i_0_4176,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4176) ).
cnf(i_0_4177,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4177) ).
cnf(i_0_4289,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4289) ).
cnf(i_0_4282,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4282) ).
cnf(i_0_4288,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,xP) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4288) ).
cnf(i_0_4298,negated_conjecture,
~ aElementOf0(esk42_0,xD),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4298) ).
cnf(i_0_4299,negated_conjecture,
aElementOf0(esk42_0,xP),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cwuwmmqn/lgb.p',i_0_4299) ).
cnf(c_0_4308,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aElementOf0(X2,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2))) ),
i_0_4142 ).
cnf(c_0_4309,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_4176 ).
cnf(c_0_4310,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_4177 ).
cnf(c_0_4311,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_4308,c_0_4309]),c_0_4310]) ).
cnf(c_0_4312,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
i_0_4289 ).
cnf(c_0_4313,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_4282 ).
cnf(c_0_4314,hypothesis,
( aElementOf0(X1,xD)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4311,c_0_4312]),c_0_4313])]) ).
cnf(c_0_4315,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,xP) ),
i_0_4288 ).
cnf(c_0_4316,negated_conjecture,
~ aElementOf0(esk42_0,xD),
i_0_4298 ).
cnf(c_0_4317,hypothesis,
( aElementOf0(X1,xD)
| ~ aElementOf0(X1,xP) ),
inference(spm,[status(thm)],[c_0_4314,c_0_4315]) ).
cnf(c_0_4318,negated_conjecture,
aElementOf0(esk42_0,xP),
i_0_4299 ).
cnf(c_0_4319,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4316,c_0_4317]),c_0_4318])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM629+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 5 13:46:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 9.10/3.59 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.10/3.59 # No SInE strategy applied
% 9.10/3.59 # Trying AutoSched0 for 150 seconds
% 9.10/3.59 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.10/3.59 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.10/3.59 #
% 9.10/3.59 # Preprocessing time : 0.026 s
% 9.10/3.59
% 9.10/3.59 # Proof found!
% 9.10/3.59 # SZS status Theorem
% 9.10/3.59 # SZS output start CNFRefutation
% See solution above
% 9.10/3.59 # Training examples: 0 positive, 0 negative
% 9.10/3.59
% 9.10/3.59 # -------------------------------------------------
% 9.10/3.59 # User time : 0.054 s
% 9.10/3.59 # System time : 0.007 s
% 9.10/3.59 # Total time : 0.060 s
% 9.10/3.59 # Maximum resident set size: 7124 pages
% 9.10/3.59
%------------------------------------------------------------------------------