TSTP Solution File: SEU137+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:44 EDT 2022
% Result : Theorem 7.01s 2.00s
% Output : CNFRefutation 7.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 7 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 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_69,negated_conjecture,
set_union2(esk10_0,set_difference(esk11_0,esk10_0)) != esk11_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-19p6dxg9/input.p',i_0_69) ).
cnf(i_0_62,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-19p6dxg9/input.p',i_0_62) ).
cnf(i_0_47,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-19p6dxg9/input.p',i_0_47) ).
cnf(i_0_70,negated_conjecture,
subset(esk10_0,esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-19p6dxg9/input.p',i_0_70) ).
cnf(c_0_75,negated_conjecture,
set_union2(esk10_0,set_difference(esk11_0,esk10_0)) != esk11_0,
i_0_69 ).
cnf(c_0_76,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
i_0_62 ).
cnf(c_0_77,negated_conjecture,
set_union2(esk10_0,esk11_0) != esk11_0,
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
i_0_47 ).
cnf(c_0_79,negated_conjecture,
subset(esk10_0,esk11_0),
i_0_70 ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU137+2 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Mon Jun 20 09:06:20 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.11/0.32 # ENIGMATIC: Selected complete mode:
% 7.01/2.00 # ENIGMATIC: Solved by autoschedule:
% 7.01/2.00 # No SInE strategy applied
% 7.01/2.00 # Trying AutoSched0 for 150 seconds
% 7.01/2.00 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.01/2.00 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.01/2.00 #
% 7.01/2.00 # Preprocessing time : 0.013 s
% 7.01/2.00 # Presaturation interreduction done
% 7.01/2.00
% 7.01/2.00 # Proof found!
% 7.01/2.00 # SZS status Theorem
% 7.01/2.00 # SZS output start CNFRefutation
% See solution above
% 7.01/2.00 # Training examples: 0 positive, 0 negative
% 7.01/2.00
% 7.01/2.00 # -------------------------------------------------
% 7.01/2.00 # User time : 0.015 s
% 7.01/2.00 # System time : 0.004 s
% 7.01/2.00 # Total time : 0.019 s
% 7.01/2.00 # Maximum resident set size: 7120 pages
% 7.01/2.00
%------------------------------------------------------------------------------