TSTP Solution File: SEU104+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.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:29 EDT 2022
% Result : Theorem 8.06s 2.29s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 4 unt; 4 nHn; 17 RR)
% Number of literals : 46 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
( preboolean(X1)
| ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(symmetric_difference(esk11_1(X1),set_difference(esk12_1(X1),esk11_1(X1))),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_49) ).
cnf(i_0_56,negated_conjecture,
( in(symmetric_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_56) ).
cnf(i_0_54,negated_conjecture,
~ preboolean(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_54) ).
cnf(i_0_59,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_59) ).
cnf(i_0_55,negated_conjecture,
( in(set_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_55) ).
cnf(i_0_50,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_50) ).
cnf(i_0_51,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-501bfazz/input.p',i_0_51) ).
cnf(c_0_67,plain,
( preboolean(X1)
| ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(symmetric_difference(esk11_1(X1),set_difference(esk12_1(X1),esk11_1(X1))),X1) ),
i_0_49 ).
cnf(c_0_68,negated_conjecture,
( in(symmetric_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
i_0_56 ).
cnf(c_0_69,negated_conjecture,
~ preboolean(esk13_0),
i_0_54 ).
cnf(c_0_70,negated_conjecture,
( ~ in(set_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(set_difference(esk12_1(esk13_0),esk11_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_71,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_59 ).
cnf(c_0_72,plain,
( ~ in(set_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ in(set_difference(esk12_1(esk13_0),esk11_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,negated_conjecture,
( in(set_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
i_0_55 ).
cnf(c_0_74,negated_conjecture,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(esk12_1(esk13_0),esk13_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_73]) ).
cnf(c_0_75,plain,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_74,c_0_71]) ).
cnf(c_0_76,plain,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ in(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_71]) ).
cnf(c_0_77,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
i_0_50 ).
cnf(c_0_78,plain,
~ in(esk11_1(esk13_0),esk13_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_69]) ).
cnf(c_0_79,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
i_0_51 ).
cnf(c_0_80,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n012.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 08:37:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.06/2.29 # ENIGMATIC: Solved by autoschedule:
% 8.06/2.29 # No SInE strategy applied
% 8.06/2.29 # Trying AutoSched0 for 150 seconds
% 8.06/2.29 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.06/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.06/2.29 #
% 8.06/2.29 # Preprocessing time : 0.025 s
% 8.06/2.29
% 8.06/2.29 # Proof found!
% 8.06/2.29 # SZS status Theorem
% 8.06/2.29 # SZS output start CNFRefutation
% See solution above
% 8.06/2.29 # Training examples: 0 positive, 0 negative
% 8.06/2.29
% 8.06/2.29 # -------------------------------------------------
% 8.06/2.29 # User time : 0.033 s
% 8.06/2.29 # System time : 0.008 s
% 8.06/2.29 # Total time : 0.041 s
% 8.06/2.29 # Maximum resident set size: 7120 pages
% 8.06/2.29
%------------------------------------------------------------------------------