TSTP Solution File: NUM560+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM560+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:21 EDT 2022
% Result : Theorem 7.83s 2.30s
% Output : CNFRefutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_128,negated_conjecture,
~ aElementOf0(esk14_0,szDzozmdt0(xF)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9tsmu2tt/lgb.p',i_0_128) ).
cnf(i_0_132,negated_conjecture,
( aElementOf0(X1,szDzozmdt0(xF))
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9tsmu2tt/lgb.p',i_0_132) ).
cnf(i_0_129,negated_conjecture,
aElementOf0(esk14_0,sdtlbdtrb0(xF,xy)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9tsmu2tt/lgb.p',i_0_129) ).
cnf(c_0_136,negated_conjecture,
~ aElementOf0(esk14_0,szDzozmdt0(xF)),
i_0_128 ).
cnf(c_0_137,negated_conjecture,
( aElementOf0(X1,szDzozmdt0(xF))
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ),
i_0_132 ).
cnf(c_0_138,negated_conjecture,
aElementOf0(esk14_0,sdtlbdtrb0(xF,xy)),
i_0_129 ).
cnf(c_0_139,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM560+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n003.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 : Tue Jul 5 12:03:57 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.83/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.83/2.30 # No SInE strategy applied
% 7.83/2.30 # Trying AutoSched0 for 150 seconds
% 7.83/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.83/2.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.83/2.30 #
% 7.83/2.30 # Preprocessing time : 0.023 s
% 7.83/2.30 # Presaturation interreduction done
% 7.83/2.30
% 7.83/2.30 # Proof found!
% 7.83/2.30 # SZS status Theorem
% 7.83/2.30 # SZS output start CNFRefutation
% See solution above
% 7.83/2.30 # Training examples: 0 positive, 0 negative
% 7.83/2.30
% 7.83/2.30 # -------------------------------------------------
% 7.83/2.30 # User time : 0.024 s
% 7.83/2.30 # System time : 0.005 s
% 7.83/2.30 # Total time : 0.029 s
% 7.83/2.30 # Maximum resident set size: 7124 pages
% 7.83/2.30
%------------------------------------------------------------------------------