TSTP Solution File: NUM588+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:40 EDT 2022
% Result : Theorem 9.32s 3.41s
% Output : CNFRefutation 9.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4199,negated_conjecture,
~ aElementOf0(esk37_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jkea_4g/lgb.p',i_0_4199) ).
cnf(i_0_4215,negated_conjecture,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
| ~ aElementOf0(X1,esk35_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jkea_4g/lgb.p',i_0_4215) ).
cnf(i_0_4211,negated_conjecture,
( aElementOf0(X1,esk35_0)
| ~ aElementOf0(X1,esk36_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jkea_4g/lgb.p',i_0_4211) ).
cnf(i_0_4200,negated_conjecture,
aElementOf0(esk37_0,esk36_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jkea_4g/lgb.p',i_0_4200) ).
cnf(c_0_4220,negated_conjecture,
~ aElementOf0(esk37_0,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0)))),
i_0_4199 ).
cnf(c_0_4221,negated_conjecture,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,esk34_0),szmzizndt0(sdtlpdtrp0(xN,esk34_0))))
| ~ aElementOf0(X1,esk35_0) ),
i_0_4215 ).
cnf(c_0_4222,negated_conjecture,
( aElementOf0(X1,esk35_0)
| ~ aElementOf0(X1,esk36_0) ),
i_0_4211 ).
cnf(c_0_4223,negated_conjecture,
aElementOf0(esk37_0,esk36_0),
i_0_4200 ).
cnf(c_0_4224,negated_conjecture,
~ aElementOf0(esk37_0,esk35_0),
inference(spm,[status(thm)],[c_0_4220,c_0_4221]) ).
cnf(c_0_4225,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4222,c_0_4223]),c_0_4224]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM588+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n012.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jul 6 21:25:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 9.32/3.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.32/3.41 # No SInE strategy applied
% 9.32/3.41 # Trying AutoSched0 for 150 seconds
% 9.32/3.41 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.32/3.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.32/3.41 #
% 9.32/3.41 # Preprocessing time : 0.014 s
% 9.32/3.41
% 9.32/3.41 # Proof found!
% 9.32/3.41 # SZS status Theorem
% 9.32/3.41 # SZS output start CNFRefutation
% See solution above
% 9.32/3.41 # Training examples: 0 positive, 0 negative
% 9.32/3.41
% 9.32/3.41 # -------------------------------------------------
% 9.32/3.41 # User time : 0.013 s
% 9.32/3.41 # System time : 0.006 s
% 9.32/3.41 # Total time : 0.019 s
% 9.32/3.41 # Maximum resident set size: 7128 pages
% 9.32/3.41
%------------------------------------------------------------------------------