TSTP Solution File: NUM548+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM548+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:14 EDT 2022
% Result : Theorem 8.12s 2.34s
% Output : CNFRefutation 8.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_67,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37bv1dh4/lgb.p',i_0_67) ).
cnf(i_0_144,hypothesis,
sbrdtbr0(xQ) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37bv1dh4/lgb.p',i_0_144) ).
cnf(i_0_147,hypothesis,
aSet0(xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37bv1dh4/lgb.p',i_0_147) ).
cnf(i_0_111,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37bv1dh4/lgb.p',i_0_111) ).
cnf(i_0_148,negated_conjecture,
~ isFinite0(xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37bv1dh4/lgb.p',i_0_148) ).
cnf(c_0_154,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
i_0_67 ).
cnf(c_0_155,hypothesis,
sbrdtbr0(xQ) = xk,
i_0_144 ).
cnf(c_0_156,hypothesis,
aSet0(xQ),
i_0_147 ).
cnf(c_0_157,hypothesis,
aElementOf0(xk,szNzAzT0),
i_0_111 ).
cnf(c_0_158,negated_conjecture,
~ isFinite0(xQ),
i_0_148 ).
cnf(c_0_159,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156]),c_0_157])]),c_0_158]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM548+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.32 % Computer : n015.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Thu Jul 7 02:28:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.12/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.12/2.34 # No SInE strategy applied
% 8.12/2.34 # Trying AutoSched0 for 150 seconds
% 8.12/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.12/2.34 # and selection function SelectNewComplexAHP.
% 8.12/2.34 #
% 8.12/2.34 # Preprocessing time : 0.024 s
% 8.12/2.34 # Presaturation interreduction done
% 8.12/2.34
% 8.12/2.34 # Proof found!
% 8.12/2.34 # SZS status Theorem
% 8.12/2.34 # SZS output start CNFRefutation
% See solution above
% 8.12/2.34 # Training examples: 0 positive, 0 negative
% 8.12/2.34
% 8.12/2.34 # -------------------------------------------------
% 8.12/2.34 # User time : 0.027 s
% 8.12/2.34 # System time : 0.008 s
% 8.12/2.34 # Total time : 0.035 s
% 8.12/2.34 # Maximum resident set size: 7124 pages
% 8.12/2.34
%------------------------------------------------------------------------------