TSTP Solution File: NUM531+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:03 EDT 2022
% Result : Theorem 7.36s 2.38s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 16 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
isFinite0(slcrc0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bqlmmtt/lgb.p',i_0_8) ).
cnf(i_0_11,negated_conjecture,
esk2_0 = slcrc0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bqlmmtt/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ isCountable0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bqlmmtt/lgb.p',i_0_10) ).
cnf(i_0_13,negated_conjecture,
isCountable0(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bqlmmtt/lgb.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
aSet0(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bqlmmtt/lgb.p',i_0_14) ).
cnf(c_0_20,plain,
isFinite0(slcrc0),
i_0_8 ).
cnf(c_0_21,negated_conjecture,
esk2_0 = slcrc0,
i_0_11 ).
cnf(c_0_22,plain,
( ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ isCountable0(X1) ),
i_0_10 ).
cnf(c_0_23,plain,
isFinite0(esk2_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
isCountable0(esk2_0),
i_0_13 ).
cnf(c_0_25,negated_conjecture,
aSet0(esk2_0),
i_0_14 ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM531+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jul 7 04:10:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.36/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.36/2.38 # No SInE strategy applied
% 7.36/2.38 # Trying AutoSched0 for 150 seconds
% 7.36/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 7.36/2.38 # and selection function PSelectAllCondOptimalLit.
% 7.36/2.38 #
% 7.36/2.38 # Preprocessing time : 0.023 s
% 7.36/2.38 # Presaturation interreduction done
% 7.36/2.38
% 7.36/2.38 # Proof found!
% 7.36/2.38 # SZS status Theorem
% 7.36/2.38 # SZS output start CNFRefutation
% See solution above
% 7.36/2.38 # Training examples: 0 positive, 0 negative
% 7.36/2.38
% 7.36/2.38 # -------------------------------------------------
% 7.36/2.38 # User time : 0.022 s
% 7.36/2.38 # System time : 0.009 s
% 7.36/2.38 # Total time : 0.032 s
% 7.36/2.38 # Maximum resident set size: 7124 pages
% 7.36/2.38
%------------------------------------------------------------------------------