TSTP Solution File: SEU317+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:44 EDT 2022
% Result : Theorem 10.62s 2.63s
% Output : CNFRefutation 10.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 7 unt; 5 nHn; 22 RR)
% Number of literals : 65 ( 0 equ; 38 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_43) ).
cnf(i_0_77,plain,
( in(X1,topstr_closure(X2,X3))
| subset(X3,esk8_3(X2,X3,X1))
| ~ top_str(X2)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_77) ).
cnf(i_0_75,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_75) ).
cnf(i_0_76,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,esk8_3(X2,X3,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_76) ).
cnf(i_0_41,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_41) ).
cnf(i_0_42,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_42) ).
cnf(i_0_81,negated_conjecture,
~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_81) ).
cnf(i_0_83,negated_conjecture,
top_str(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_83) ).
cnf(i_0_82,negated_conjecture,
element(esk10_0,powerset(the_carrier(esk9_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qwfa13y7/lgb.p',i_0_82) ).
cnf(c_0_93,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_43 ).
cnf(c_0_94,plain,
( in(X1,topstr_closure(X2,X3))
| subset(X3,esk8_3(X2,X3,X1))
| ~ top_str(X2)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2))) ),
i_0_77 ).
cnf(c_0_95,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_75 ).
cnf(c_0_96,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,esk8_3(X2,X3,X1)) ),
i_0_76 ).
cnf(c_0_97,plain,
( in(X1,esk8_3(X2,X3,X4))
| in(X4,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X4,the_carrier(X2))
| ~ in(X1,X3)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_98,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_93,c_0_95]) ).
cnf(c_0_99,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_41 ).
cnf(c_0_100,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]) ).
cnf(c_0_101,plain,
( subset(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ in(esk1_2(X1,topstr_closure(X2,X3)),X3)
| ~ element(X3,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_102,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_42 ).
cnf(c_0_103,negated_conjecture,
~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
i_0_81 ).
cnf(c_0_104,plain,
( subset(X1,topstr_closure(X2,X1))
| ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2))) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
top_str(esk9_0),
i_0_83 ).
cnf(c_0_106,negated_conjecture,
element(esk10_0,powerset(the_carrier(esk9_0))),
i_0_82 ).
cnf(c_0_107,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_105]),c_0_106])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU317+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 19:14:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected complete mode:
% 10.62/2.63 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.62/2.63 # No SInE strategy applied
% 10.62/2.63 # Trying AutoSched0 for 150 seconds
% 10.62/2.63 # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 10.62/2.63 # and selection function SelectMaxLComplexAPPNTNp.
% 10.62/2.63 #
% 10.62/2.63 # Preprocessing time : 0.023 s
% 10.62/2.63
% 10.62/2.63 # Proof found!
% 10.62/2.63 # SZS status Theorem
% 10.62/2.63 # SZS output start CNFRefutation
% See solution above
% 10.62/2.63 # Training examples: 0 positive, 0 negative
% 10.62/2.63
% 10.62/2.63 # -------------------------------------------------
% 10.62/2.63 # User time : 0.323 s
% 10.62/2.63 # System time : 0.009 s
% 10.62/2.63 # Total time : 0.332 s
% 10.62/2.63 # Maximum resident set size: 7124 pages
% 10.62/2.63
%------------------------------------------------------------------------------