TSTP Solution File: SEU107+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:38:29 EDT 2022
% Result : Theorem 7.67s 2.36s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 14 unt; 10 nHn; 21 RR)
% Number of literals : 58 ( 8 equ; 26 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_41) ).
cnf(i_0_8,plain,
element(esk1_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_8) ).
cnf(i_0_48,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_48) ).
cnf(i_0_42,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_42) ).
cnf(i_0_7,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_7) ).
cnf(i_0_44,negated_conjecture,
preboolean(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_44) ).
cnf(i_0_45,negated_conjecture,
~ empty(esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_45) ).
cnf(i_0_47,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_47) ).
cnf(i_0_43,negated_conjecture,
~ in(empty_set,esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w9tihe70/lgb.p',i_0_43) ).
cnf(c_0_58,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_41 ).
cnf(c_0_59,plain,
element(esk1_1(X1),X1),
i_0_8 ).
cnf(c_0_60,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_48 ).
cnf(c_0_61,plain,
subset(X1,X1),
i_0_42 ).
cnf(c_0_62,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_7 ).
cnf(c_0_63,plain,
( prebool_difference(X1,X2,esk1_1(X1)) = set_difference(X2,esk1_1(X1))
| empty(X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
set_difference(X1,X1) = empty_set,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( element(prebool_difference(X1,X2,esk1_1(X1)),X1)
| empty(X1)
| ~ element(X2,X1)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_59]) ).
cnf(c_0_66,plain,
( prebool_difference(X1,esk1_1(X1),esk1_1(X1)) = empty_set
| empty(X1)
| ~ preboolean(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_59]),c_0_64]) ).
cnf(c_0_67,negated_conjecture,
preboolean(esk11_0),
i_0_44 ).
cnf(c_0_68,negated_conjecture,
~ empty(esk11_0),
i_0_45 ).
cnf(c_0_69,plain,
( element(prebool_difference(X1,esk1_1(X1),esk1_1(X1)),X1)
| empty(X1)
| ~ preboolean(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_59]) ).
cnf(c_0_70,negated_conjecture,
prebool_difference(esk11_0,esk1_1(esk11_0),esk1_1(esk11_0)) = empty_set,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_71,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_47 ).
cnf(c_0_72,negated_conjecture,
element(empty_set,esk11_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_70]),c_0_68]) ).
cnf(c_0_73,negated_conjecture,
~ in(empty_set,esk11_0),
i_0_43 ).
cnf(c_0_74,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_68]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 19:28:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.67/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.67/2.36 # No SInE strategy applied
% 7.67/2.36 # Trying AutoSched0 for 150 seconds
% 7.67/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.67/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.67/2.36 #
% 7.67/2.36 # Preprocessing time : 0.012 s
% 7.67/2.36 # Presaturation interreduction done
% 7.67/2.36
% 7.67/2.36 # Proof found!
% 7.67/2.36 # SZS status Theorem
% 7.67/2.36 # SZS output start CNFRefutation
% See solution above
% 7.67/2.36 # Training examples: 0 positive, 0 negative
% 7.67/2.36
% 7.67/2.36 # -------------------------------------------------
% 7.67/2.36 # User time : 0.020 s
% 7.67/2.36 # System time : 0.003 s
% 7.67/2.36 # Total time : 0.023 s
% 7.67/2.36 # Maximum resident set size: 7124 pages
% 7.67/2.36
%------------------------------------------------------------------------------