TSTP Solution File: SEU145+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 8.69s 2.53s
% Output : CNFRefutation 8.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 7 unt; 10 nHn; 17 RR)
% Number of literals : 53 ( 8 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_8) ).
cnf(i_0_19,negated_conjecture,
subset(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_19) ).
cnf(i_0_12,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_12) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_7) ).
cnf(i_0_5,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_5) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_6) ).
cnf(i_0_17,negated_conjecture,
~ subset(esk4_0,set_difference(esk5_0,singleton(esk6_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_17) ).
cnf(i_0_18,negated_conjecture,
~ in(esk6_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ghplz1rg/input.p',i_0_18) ).
cnf(c_0_28,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_8 ).
cnf(c_0_29,negated_conjecture,
subset(esk4_0,esk5_0),
i_0_19 ).
cnf(c_0_30,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_12 ).
cnf(c_0_31,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_7 ).
cnf(c_0_33,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( in(esk2_2(esk4_0,X1),esk5_0)
| subset(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
i_0_6 ).
cnf(c_0_37,plain,
( in(esk2_2(esk4_0,X1),set_difference(esk5_0,X2))
| in(esk2_2(esk4_0,X1),X2)
| subset(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
( in(esk2_2(esk4_0,set_difference(esk5_0,X1)),X1)
| subset(esk4_0,set_difference(esk5_0,X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( esk2_2(esk4_0,set_difference(esk5_0,singleton(X1))) = X1
| subset(esk4_0,set_difference(esk5_0,singleton(X1))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ subset(esk4_0,set_difference(esk5_0,singleton(esk6_0))),
i_0_17 ).
cnf(c_0_42,plain,
( in(X1,esk4_0)
| subset(esk4_0,set_difference(esk5_0,singleton(X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ in(esk6_0,esk4_0),
i_0_18 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 07:54:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.69/2.53 # ENIGMATIC: Solved by autoschedule:
% 8.69/2.53 # No SInE strategy applied
% 8.69/2.53 # Trying AutoSched0 for 150 seconds
% 8.69/2.53 # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 8.69/2.53 # and selection function SelectNewComplexAHP.
% 8.69/2.53 #
% 8.69/2.53 # Preprocessing time : 0.023 s
% 8.69/2.53
% 8.69/2.53 # Proof found!
% 8.69/2.53 # SZS status Theorem
% 8.69/2.53 # SZS output start CNFRefutation
% See solution above
% 8.69/2.53 # Training examples: 0 positive, 0 negative
% 8.69/2.53
% 8.69/2.53 # -------------------------------------------------
% 8.69/2.53 # User time : 0.033 s
% 8.69/2.53 # System time : 0.004 s
% 8.69/2.53 # Total time : 0.037 s
% 8.69/2.53 # Maximum resident set size: 7120 pages
% 8.69/2.53
%------------------------------------------------------------------------------