TSTP Solution File: SEU146+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:49 EDT 2022
% Result : Theorem 7.78s 2.41s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 7 unt; 9 nHn; 20 RR)
% Number of literals : 58 ( 24 equ; 21 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(X1,X2)
| subset(X2,set_difference(X3,singleton(X1)))
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_11) ).
cnf(i_0_17,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_17) ).
cnf(i_0_19,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_19) ).
cnf(i_0_12,negated_conjecture,
( esk1_0 = empty_set
| singleton(esk2_0) = esk1_0
| subset(esk1_0,singleton(esk2_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_12) ).
cnf(i_0_21,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_21) ).
cnf(i_0_2,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_2) ).
cnf(i_0_9,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_9) ).
cnf(i_0_13,negated_conjecture,
( singleton(esk2_0) != esk1_0
| ~ subset(esk1_0,singleton(esk2_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_13) ).
cnf(i_0_18,plain,
subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_18) ).
cnf(i_0_14,negated_conjecture,
( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r0k9a5f5/lgb.p',i_0_14) ).
cnf(c_0_32,plain,
( in(X1,X2)
| subset(X2,set_difference(X3,singleton(X1)))
| ~ subset(X2,X3) ),
i_0_11 ).
cnf(c_0_33,plain,
subset(X1,X1),
i_0_17 ).
cnf(c_0_34,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_19 ).
cnf(c_0_35,negated_conjecture,
( esk1_0 = empty_set
| singleton(esk2_0) = esk1_0
| subset(esk1_0,singleton(esk2_0)) ),
i_0_12 ).
cnf(c_0_36,plain,
( in(X1,X2)
| subset(X2,set_difference(X2,singleton(X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( set_difference(esk1_0,singleton(esk2_0)) = empty_set
| singleton(esk2_0) = esk1_0
| empty_set = esk1_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
i_0_21 ).
cnf(c_0_39,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_2 ).
cnf(c_0_40,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
i_0_9 ).
cnf(c_0_41,plain,
( singleton(esk2_0) = esk1_0
| empty_set = esk1_0
| in(esk2_0,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( singleton(esk2_0) = esk1_0
| empty_set = esk1_0
| ~ subset(singleton(esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( singleton(esk2_0) != esk1_0
| ~ subset(esk1_0,singleton(esk2_0)) ),
i_0_13 ).
cnf(c_0_44,plain,
( singleton(esk2_0) = esk1_0
| empty_set = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
subset(empty_set,X1),
i_0_18 ).
cnf(c_0_46,negated_conjecture,
empty_set = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_33])]) ).
cnf(c_0_47,negated_conjecture,
( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) ),
i_0_14 ).
cnf(c_0_48,plain,
subset(esk1_0,X1),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_46])]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU146+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n014.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 : Sat Jun 18 22:47:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.78/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.78/2.41 # No SInE strategy applied
% 7.78/2.41 # Trying AutoSched0 for 150 seconds
% 7.78/2.41 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.78/2.41 # and selection function SelectNewComplexAHPNS.
% 7.78/2.41 #
% 7.78/2.41 # Preprocessing time : 0.024 s
% 7.78/2.41
% 7.78/2.41 # Proof found!
% 7.78/2.41 # SZS status Theorem
% 7.78/2.41 # SZS output start CNFRefutation
% See solution above
% 7.78/2.41 # Training examples: 0 positive, 0 negative
% 7.78/2.41
% 7.78/2.41 # -------------------------------------------------
% 7.78/2.41 # User time : 0.026 s
% 7.78/2.41 # System time : 0.004 s
% 7.78/2.41 # Total time : 0.031 s
% 7.78/2.41 # Maximum resident set size: 7128 pages
% 7.78/2.41
%------------------------------------------------------------------------------