TSTP Solution File: SEU355+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:07 EDT 2022
% Result : Theorem 7.53s 2.39s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 8 unt; 6 nHn; 14 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 20 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( relstr_set_smaller(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_8) ).
cnf(i_0_28,negated_conjecture,
element(esk10_0,the_carrier(esk9_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_28) ).
cnf(i_0_29,negated_conjecture,
rel_str(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_29) ).
cnf(i_0_30,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_30) ).
cnf(i_0_4,plain,
( relstr_element_smaller(X1,X2,X3)
| in(esk1_3(X1,X2,X3),X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_4) ).
cnf(i_0_27,negated_conjecture,
( ~ relstr_element_smaller(esk9_0,empty_set,esk10_0)
| ~ relstr_set_smaller(esk9_0,empty_set,esk10_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_27) ).
cnf(i_0_19,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-asv7ff2d/lgb.p',i_0_19) ).
cnf(c_0_38,plain,
( relstr_set_smaller(X1,X2,X3)
| in(esk2_3(X1,X2,X3),X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1)) ),
i_0_8 ).
cnf(c_0_39,negated_conjecture,
element(esk10_0,the_carrier(esk9_0)),
i_0_28 ).
cnf(c_0_40,negated_conjecture,
rel_str(esk9_0),
i_0_29 ).
cnf(c_0_41,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_30 ).
cnf(c_0_42,negated_conjecture,
( in(esk2_3(esk9_0,X1,esk10_0),X1)
| relstr_set_smaller(esk9_0,X1,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,plain,
( relstr_element_smaller(X1,X2,X3)
| in(esk1_3(X1,X2,X3),X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1)) ),
i_0_4 ).
cnf(c_0_44,negated_conjecture,
( ~ relstr_element_smaller(esk9_0,empty_set,esk10_0)
| ~ relstr_set_smaller(esk9_0,empty_set,esk10_0) ),
i_0_27 ).
cnf(c_0_45,plain,
( relstr_set_smaller(esk9_0,X1,esk10_0)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
empty(empty_set),
i_0_19 ).
cnf(c_0_47,negated_conjecture,
( in(esk1_3(esk9_0,X1,esk10_0),X1)
| relstr_element_smaller(esk9_0,X1,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
~ relstr_element_smaller(esk9_0,empty_set,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_49,plain,
( relstr_element_smaller(esk9_0,X1,esk10_0)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_50,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Sun Jun 19 10:47:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.53/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.53/2.39 # No SInE strategy applied
% 7.53/2.39 # Trying AutoSched0 for 150 seconds
% 7.53/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.53/2.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.53/2.39 #
% 7.53/2.39 # Preprocessing time : 0.023 s
% 7.53/2.39 # Presaturation interreduction done
% 7.53/2.39
% 7.53/2.39 # Proof found!
% 7.53/2.39 # SZS status Theorem
% 7.53/2.39 # SZS output start CNFRefutation
% See solution above
% 7.53/2.39 # Training examples: 0 positive, 0 negative
% 7.53/2.39
% 7.53/2.39 # -------------------------------------------------
% 7.53/2.39 # User time : 0.024 s
% 7.53/2.39 # System time : 0.006 s
% 7.53/2.39 # Total time : 0.030 s
% 7.53/2.39 # Maximum resident set size: 7128 pages
% 7.53/2.39
%------------------------------------------------------------------------------