TSTP Solution File: SEU144+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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 4.80s 2.39s
% Output : CNFRefutation 4.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 9 unt; 7 nHn; 20 RR)
% Number of literals : 46 ( 11 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( X1 = X2
| X3 != unordered_pair(X2,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_12) ).
cnf(i_0_29,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_29) ).
cnf(i_0_60,negated_conjecture,
( in(esk8_0,esk9_0)
| subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_60) ).
cnf(i_0_13,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_13) ).
cnf(i_0_59,lemma,
unordered_pair(X1,X1) != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_59) ).
cnf(i_0_61,negated_conjecture,
( ~ in(esk8_0,esk9_0)
| ~ subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_61) ).
cnf(i_0_28,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_28) ).
cnf(i_0_27,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5zmf82ca/input.p',i_0_27) ).
cnf(c_0_70,plain,
( X1 = X2
| X3 != unordered_pair(X2,X2)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_71,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_29 ).
cnf(c_0_72,negated_conjecture,
( in(esk8_0,esk9_0)
| subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
i_0_60 ).
cnf(c_0_73,plain,
( X1 = X2
| ~ in(X1,unordered_pair(X2,X2)) ),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_74,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
i_0_13 ).
cnf(c_0_75,lemma,
unordered_pair(X1,X1) != empty_set,
i_0_59 ).
cnf(c_0_76,negated_conjecture,
( in(esk8_0,esk9_0)
| in(X1,esk9_0)
| ~ in(X1,unordered_pair(esk8_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
esk2_1(unordered_pair(X1,X1)) = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( ~ in(esk8_0,esk9_0)
| ~ subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
i_0_61 ).
cnf(c_0_79,plain,
in(esk8_0,esk9_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_77])]),c_0_75]) ).
cnf(c_0_80,negated_conjecture,
~ subset(unordered_pair(esk8_0,esk8_0),esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_81,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
i_0_28 ).
cnf(c_0_82,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
i_0_27 ).
cnf(c_0_83,plain,
in(esk5_2(unordered_pair(esk8_0,esk8_0),esk9_0),unordered_pair(esk8_0,esk8_0)),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_84,plain,
~ in(esk5_2(unordered_pair(esk8_0,esk8_0),esk9_0),esk9_0),
inference(spm,[status(thm)],[c_0_80,c_0_82]) ).
cnf(c_0_85,plain,
esk5_2(unordered_pair(esk8_0,esk8_0),esk9_0) = esk8_0,
inference(spm,[status(thm)],[c_0_73,c_0_83]) ).
cnf(c_0_86,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 17:07:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.80/2.39 # ENIGMATIC: Solved by autoschedule:
% 4.80/2.39 # No SInE strategy applied
% 4.80/2.39 # Trying AutoSched0 for 150 seconds
% 4.80/2.39 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 4.80/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.80/2.39 #
% 4.80/2.39 # Preprocessing time : 0.013 s
% 4.80/2.39 # Presaturation interreduction done
% 4.80/2.39
% 4.80/2.39 # Proof found!
% 4.80/2.39 # SZS status Theorem
% 4.80/2.39 # SZS output start CNFRefutation
% See solution above
% 4.80/2.39 # Training examples: 0 positive, 0 negative
% 4.80/2.39
% 4.80/2.39 # -------------------------------------------------
% 4.80/2.39 # User time : 0.031 s
% 4.80/2.39 # System time : 0.005 s
% 4.80/2.39 # Total time : 0.036 s
% 4.80/2.39 # Maximum resident set size: 7116 pages
% 4.80/2.39
%------------------------------------------------------------------------------