TSTP Solution File: SEU294+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 : Tue Jul 19 08:40:29 EDT 2022
% Result : Theorem 7.62s 2.45s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( finite(X1)
| ~ finite(X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q8ybh_4g/lgb.p',i_0_14) ).
cnf(i_0_104,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q8ybh_4g/lgb.p',i_0_104) ).
cnf(i_0_101,negated_conjecture,
subset(esk20_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q8ybh_4g/lgb.p',i_0_101) ).
cnf(i_0_100,negated_conjecture,
finite(esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q8ybh_4g/lgb.p',i_0_100) ).
cnf(i_0_99,negated_conjecture,
~ finite(esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q8ybh_4g/lgb.p',i_0_99) ).
cnf(c_0_110,plain,
( finite(X1)
| ~ finite(X2)
| ~ element(X1,powerset(X2)) ),
i_0_14 ).
cnf(c_0_111,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_104 ).
cnf(c_0_112,plain,
( finite(X1)
| ~ finite(X2)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_113,negated_conjecture,
subset(esk20_0,esk21_0),
i_0_101 ).
cnf(c_0_114,negated_conjecture,
finite(esk21_0),
i_0_100 ).
cnf(c_0_115,negated_conjecture,
~ finite(esk20_0),
i_0_99 ).
cnf(c_0_116,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114])]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 03:56:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.62/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.45 # No SInE strategy applied
% 7.62/2.45 # Trying AutoSched0 for 150 seconds
% 7.62/2.45 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.62/2.45 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.45 #
% 7.62/2.45 # Preprocessing time : 0.013 s
% 7.62/2.45
% 7.62/2.45 # Proof found!
% 7.62/2.45 # SZS status Theorem
% 7.62/2.45 # SZS output start CNFRefutation
% See solution above
% 7.62/2.45 # Training examples: 0 positive, 0 negative
% 7.62/2.45
% 7.62/2.45 # -------------------------------------------------
% 7.62/2.45 # User time : 0.018 s
% 7.62/2.45 # System time : 0.001 s
% 7.62/2.45 # Total time : 0.019 s
% 7.62/2.45 # Maximum resident set size: 7128 pages
% 7.62/2.45
%------------------------------------------------------------------------------