TSTP Solution File: NUM600+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM600+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:37:47 EDT 2022
% Result : Theorem 9.32s 3.43s
% Output : CNFRefutation 9.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 7 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4232,hypothesis,
( aElementOf0(X1,szDzozmdt0(xd))
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfsz61cq/lgb.p',i_0_4232) ).
cnf(i_0_4213,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfsz61cq/lgb.p',i_0_4213) ).
cnf(i_0_4237,negated_conjecture,
( sdtlpdtrp0(xe,X1) != esk39_0
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfsz61cq/lgb.p',i_0_4237) ).
cnf(i_0_4241,negated_conjecture,
aElementOf0(esk40_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfsz61cq/lgb.p',i_0_4241) ).
cnf(i_0_4240,negated_conjecture,
sdtlpdtrp0(xe,esk40_0) = esk39_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xfsz61cq/lgb.p',i_0_4240) ).
cnf(c_0_4247,hypothesis,
( aElementOf0(X1,szDzozmdt0(xd))
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
i_0_4232 ).
cnf(c_0_4248,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
i_0_4213 ).
cnf(c_0_4249,negated_conjecture,
( sdtlpdtrp0(xe,X1) != esk39_0
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
i_0_4237 ).
cnf(c_0_4250,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(rw,[status(thm)],[c_0_4247,c_0_4248]) ).
cnf(c_0_4251,negated_conjecture,
( sdtlpdtrp0(xe,X1) != esk39_0
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(csr,[status(thm)],[c_0_4249,c_0_4250]) ).
cnf(c_0_4252,negated_conjecture,
aElementOf0(esk40_0,sdtlbdtrb0(xd,szDzizrdt0(xd))),
i_0_4241 ).
cnf(c_0_4253,negated_conjecture,
sdtlpdtrp0(xe,esk40_0) = esk39_0,
i_0_4240 ).
cnf(c_0_4254,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4251,c_0_4252]),c_0_4253])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM600+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jul 6 10:51:20 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 9.32/3.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.32/3.43 # No SInE strategy applied
% 9.32/3.43 # Trying AutoSched0 for 150 seconds
% 9.32/3.43 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.32/3.43 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.32/3.43 #
% 9.32/3.43 # Preprocessing time : 0.024 s
% 9.32/3.43
% 9.32/3.43 # Proof found!
% 9.32/3.43 # SZS status Theorem
% 9.32/3.43 # SZS output start CNFRefutation
% See solution above
% 9.32/3.43 # Training examples: 0 positive, 0 negative
% 9.32/3.43
% 9.32/3.43 # -------------------------------------------------
% 9.32/3.43 # User time : 0.025 s
% 9.32/3.43 # System time : 0.004 s
% 9.32/3.43 # Total time : 0.029 s
% 9.32/3.43 # Maximum resident set size: 7120 pages
% 9.32/3.43
%------------------------------------------------------------------------------