TSTP Solution File: SEU371+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU371+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:41:37 EDT 2022
% Result : Theorem 26.77s 5.65s
% Output : CNFRefutation 26.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 19 unt; 6 nHn; 16 RR)
% Number of literals : 64 ( 17 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2890,negated_conjecture,
bottom_of_relstr(incl_POSet(powerset(esk459_0))) != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_2890) ).
cnf(i_0_187,plain,
( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
| ~ rel_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_187) ).
cnf(i_0_688,plain,
rel_str(incl_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_688) ).
cnf(i_0_2965,lemma,
( join_on_relstr(poset_of_lattice(X1),X2) = join_of_latt_set(X1,X2)
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_2965) ).
cnf(i_0_413,plain,
poset_of_lattice(boole_lattice(X1)) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_413) ).
cnf(i_0_799,plain,
~ empty_carrier(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_799) ).
cnf(i_0_3032,lemma,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_3032) ).
cnf(i_0_3090,lemma,
( join_of_latt_set(X1,empty_set) = bottom_of_semilattstr(X1)
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_3090) ).
cnf(i_0_660,plain,
latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_660) ).
cnf(i_0_791,plain,
lattice(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_791) ).
cnf(i_0_783,plain,
complete_latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h4e4ve6x/input.p',i_0_783) ).
cnf(c_0_3102,negated_conjecture,
bottom_of_relstr(incl_POSet(powerset(esk459_0))) != empty_set,
i_0_2890 ).
cnf(c_0_3103,plain,
( join_on_relstr(X1,empty_set) = bottom_of_relstr(X1)
| ~ rel_str(X1) ),
i_0_187 ).
cnf(c_0_3104,negated_conjecture,
( join_on_relstr(incl_POSet(powerset(esk459_0)),empty_set) != empty_set
| ~ rel_str(incl_POSet(powerset(esk459_0))) ),
inference(spm,[status(thm)],[c_0_3102,c_0_3103]) ).
cnf(c_0_3105,plain,
rel_str(incl_POSet(X1)),
i_0_688 ).
cnf(c_0_3106,lemma,
( join_on_relstr(poset_of_lattice(X1),X2) = join_of_latt_set(X1,X2)
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1) ),
i_0_2965 ).
cnf(c_0_3107,plain,
poset_of_lattice(boole_lattice(X1)) = incl_POSet(powerset(X1)),
i_0_413 ).
cnf(c_0_3108,negated_conjecture,
join_on_relstr(incl_POSet(powerset(esk459_0)),empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3104,c_0_3105])]) ).
cnf(c_0_3109,plain,
( join_on_relstr(incl_POSet(powerset(X1)),X2) = join_of_latt_set(boole_lattice(X1),X2)
| empty_carrier(boole_lattice(X1))
| ~ complete_latt_str(boole_lattice(X1))
| ~ lattice(boole_lattice(X1))
| ~ latt_str(boole_lattice(X1)) ),
inference(spm,[status(thm)],[c_0_3106,c_0_3107]) ).
cnf(c_0_3110,plain,
~ empty_carrier(boole_lattice(X1)),
i_0_799 ).
cnf(c_0_3111,lemma,
bottom_of_semilattstr(boole_lattice(X1)) = empty_set,
i_0_3032 ).
cnf(c_0_3112,lemma,
( join_of_latt_set(X1,empty_set) = bottom_of_semilattstr(X1)
| empty_carrier(X1)
| ~ latt_str(X1)
| ~ lattice(X1)
| ~ complete_latt_str(X1) ),
i_0_3090 ).
cnf(c_0_3113,plain,
( join_of_latt_set(boole_lattice(esk459_0),empty_set) != empty_set
| ~ complete_latt_str(boole_lattice(esk459_0))
| ~ lattice(boole_lattice(esk459_0))
| ~ latt_str(boole_lattice(esk459_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3108,c_0_3109]),c_0_3110]) ).
cnf(c_0_3114,lemma,
( join_of_latt_set(boole_lattice(X1),empty_set) = empty_set
| empty_carrier(boole_lattice(X1))
| ~ complete_latt_str(boole_lattice(X1))
| ~ lattice(boole_lattice(X1))
| ~ latt_str(boole_lattice(X1)) ),
inference(spm,[status(thm)],[c_0_3111,c_0_3112]) ).
cnf(c_0_3115,lemma,
( ~ complete_latt_str(boole_lattice(esk459_0))
| ~ lattice(boole_lattice(esk459_0))
| ~ latt_str(boole_lattice(esk459_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3113,c_0_3114]),c_0_3110]) ).
cnf(c_0_3116,plain,
latt_str(boole_lattice(X1)),
i_0_660 ).
cnf(c_0_3117,lemma,
( ~ complete_latt_str(boole_lattice(esk459_0))
| ~ lattice(boole_lattice(esk459_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3115,c_0_3116])]) ).
cnf(c_0_3118,plain,
lattice(boole_lattice(X1)),
i_0_791 ).
cnf(c_0_3119,lemma,
~ complete_latt_str(boole_lattice(esk459_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3117,c_0_3118])]) ).
cnf(c_0_3120,plain,
complete_latt_str(boole_lattice(X1)),
i_0_783 ).
cnf(c_0_3121,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3119,c_0_3120])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU371+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 10:19:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.50 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 26.77/5.65 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 26.77/5.65 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 25; version: 991; iters: 150)
% 26.77/5.65 # Preprocessing time : 2.204 s
% 26.77/5.65
% 26.77/5.65 # Proof found!
% 26.77/5.65 # SZS status Theorem
% 26.77/5.65 # SZS output start CNFRefutation
% See solution above
% 26.77/5.65 # Training examples: 0 positive, 0 negative
% 26.77/5.65
% 26.77/5.65 # -------------------------------------------------
% 26.77/5.65 # User time : 2.091 s
% 26.77/5.65 # System time : 0.141 s
% 26.77/5.65 # Total time : 2.232 s
% 26.77/5.65 # ...preprocessing : 2.204 s
% 26.77/5.65 # ...main loop : 0.027 s
% 26.77/5.65 # Maximum resident set size: 186892 pages
% 26.77/5.65
%------------------------------------------------------------------------------