TSTP Solution File: SEU387+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU387+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 08:41:46 EDT 2022
% Result : Theorem 7.82s 2.27s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 29 unt; 2 nHn; 24 RR)
% Number of literals : 72 ( 5 equ; 38 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 26 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_288,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_288) ).
cnf(i_0_276,negated_conjecture,
empty(esk30_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_276) ).
cnf(i_0_292,plain,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ reflexive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_292) ).
cnf(i_0_289,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_289) ).
cnf(i_0_277,negated_conjecture,
in(esk30_0,esk29_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_277) ).
cnf(i_0_279,negated_conjecture,
proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_279) ).
cnf(i_0_94,plain,
antisymmetric_relstr(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_94) ).
cnf(i_0_95,plain,
transitive_relstr(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_95) ).
cnf(i_0_93,plain,
lower_bounded_relstr(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_93) ).
cnf(i_0_96,plain,
reflexive_relstr(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_96) ).
cnf(i_0_61,plain,
rel_str(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_61) ).
cnf(i_0_273,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_273) ).
cnf(i_0_278,negated_conjecture,
element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_278) ).
cnf(i_0_280,negated_conjecture,
upper_relstr_subset(esk29_0,boole_POSet(esk28_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_280) ).
cnf(i_0_281,negated_conjecture,
filtered_subset(esk29_0,boole_POSet(esk28_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_281) ).
cnf(i_0_98,plain,
~ empty_carrier(boole_POSet(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ogki6uy_/lgb.p',i_0_98) ).
cnf(c_0_309,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_288 ).
cnf(c_0_310,negated_conjecture,
empty(esk30_0),
i_0_276 ).
cnf(c_0_311,plain,
( empty_carrier(X1)
| empty(X2)
| ~ rel_str(X1)
| ~ reflexive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ transitive_relstr(X1)
| ~ antisymmetric_relstr(X1)
| ~ filtered_subset(X2,X1)
| ~ upper_relstr_subset(X2,X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1))) ),
i_0_292 ).
cnf(c_0_312,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_289 ).
cnf(c_0_313,negated_conjecture,
in(esk30_0,esk29_0),
i_0_277 ).
cnf(c_0_314,negated_conjecture,
esk30_0 = empty_set,
inference(spm,[status(thm)],[c_0_309,c_0_310]) ).
cnf(c_0_315,plain,
( empty_carrier(X1)
| ~ antisymmetric_relstr(X1)
| ~ transitive_relstr(X1)
| ~ lower_bounded_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ rel_str(X1)
| ~ in(bottom_of_relstr(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ proper_element(X2,powerset(the_carrier(X1)))
| ~ upper_relstr_subset(X2,X1)
| ~ filtered_subset(X2,X1) ),
inference(csr,[status(thm)],[c_0_311,c_0_312]) ).
cnf(c_0_316,negated_conjecture,
proper_element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
i_0_279 ).
cnf(c_0_317,plain,
antisymmetric_relstr(boole_POSet(X1)),
i_0_94 ).
cnf(c_0_318,plain,
transitive_relstr(boole_POSet(X1)),
i_0_95 ).
cnf(c_0_319,plain,
lower_bounded_relstr(boole_POSet(X1)),
i_0_93 ).
cnf(c_0_320,plain,
reflexive_relstr(boole_POSet(X1)),
i_0_96 ).
cnf(c_0_321,plain,
rel_str(boole_POSet(X1)),
i_0_61 ).
cnf(c_0_322,plain,
bottom_of_relstr(boole_POSet(X1)) = empty_set,
i_0_273 ).
cnf(c_0_323,negated_conjecture,
in(empty_set,esk29_0),
inference(rw,[status(thm)],[c_0_313,c_0_314]) ).
cnf(c_0_324,negated_conjecture,
element(esk29_0,powerset(the_carrier(boole_POSet(esk28_0)))),
i_0_278 ).
cnf(c_0_325,negated_conjecture,
upper_relstr_subset(esk29_0,boole_POSet(esk28_0)),
i_0_280 ).
cnf(c_0_326,negated_conjecture,
filtered_subset(esk29_0,boole_POSet(esk28_0)),
i_0_281 ).
cnf(c_0_327,plain,
~ empty_carrier(boole_POSet(X1)),
i_0_98 ).
cnf(c_0_328,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_315,c_0_316]),c_0_317]),c_0_318]),c_0_319]),c_0_320]),c_0_321]),c_0_322]),c_0_323]),c_0_324]),c_0_325]),c_0_326])]),c_0_327]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU387+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 09:53:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.82/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.27 # No SInE strategy applied
% 7.82/2.27 # Trying AutoSched0 for 150 seconds
% 7.82/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.82/2.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.82/2.27 #
% 7.82/2.27 # Preprocessing time : 0.026 s
% 7.82/2.27 # Presaturation interreduction done
% 7.82/2.27
% 7.82/2.27 # Proof found!
% 7.82/2.27 # SZS status Theorem
% 7.82/2.27 # SZS output start CNFRefutation
% See solution above
% 7.82/2.27 # Training examples: 0 positive, 0 negative
% 7.82/2.27
% 7.82/2.27 # -------------------------------------------------
% 7.82/2.27 # User time : 0.030 s
% 7.82/2.27 # System time : 0.007 s
% 7.82/2.27 # Total time : 0.038 s
% 7.82/2.27 # Maximum resident set size: 7124 pages
% 7.82/2.27
%------------------------------------------------------------------------------