TSTP Solution File: SEU152+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU152+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:55 EDT 2022
% Result : Theorem 7.91s 2.31s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 4 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_67,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6617lyjy/input.p',i_0_67) ).
cnf(i_0_66,negated_conjecture,
in(esk9_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6617lyjy/input.p',i_0_66) ).
cnf(i_0_65,negated_conjecture,
set_union2(unordered_pair(esk9_0,esk9_0),esk10_0) != esk10_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6617lyjy/input.p',i_0_65) ).
cnf(i_0_80,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6617lyjy/input.p',i_0_80) ).
cnf(c_0_85,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
i_0_67 ).
cnf(c_0_86,negated_conjecture,
in(esk9_0,esk10_0),
i_0_66 ).
cnf(c_0_87,negated_conjecture,
set_union2(unordered_pair(esk9_0,esk9_0),esk10_0) != esk10_0,
i_0_65 ).
cnf(c_0_88,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
i_0_80 ).
cnf(c_0_89,negated_conjecture,
subset(unordered_pair(esk9_0,esk9_0),esk10_0),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU152+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 14:51:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.91/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.91/2.31 # No SInE strategy applied
% 7.91/2.31 # Trying AutoSched0 for 150 seconds
% 7.91/2.31 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.91/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.91/2.31 #
% 7.91/2.31 # Preprocessing time : 0.013 s
% 7.91/2.31 # Presaturation interreduction done
% 7.91/2.31
% 7.91/2.31 # Proof found!
% 7.91/2.31 # SZS status Theorem
% 7.91/2.31 # SZS output start CNFRefutation
% See solution above
% 7.91/2.31 # Training examples: 0 positive, 0 negative
% 7.91/2.31
% 7.91/2.31 # -------------------------------------------------
% 7.91/2.31 # User time : 0.029 s
% 7.91/2.31 # System time : 0.007 s
% 7.91/2.31 # Total time : 0.037 s
% 7.91/2.31 # Maximum resident set size: 7116 pages
% 7.91/2.31
%------------------------------------------------------------------------------