TSTP Solution File: SEU106+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU106+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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 7.53s 2.29s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 4 unt; 4 nHn; 19 RR)
% Number of literals : 52 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 2 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_54,plain,
( preboolean(X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(symmetric_difference(esk11_1(X1),symmetric_difference(symmetric_difference(esk11_1(X1),esk12_1(X1)),set_union2(esk11_1(X1),esk12_1(X1)))),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_54) ).
cnf(i_0_61,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-0nbe8b2o/input.p',i_0_61) ).
cnf(i_0_59,negated_conjecture,
~ preboolean(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_59) ).
cnf(i_0_64,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_64) ).
cnf(i_0_60,negated_conjecture,
( in(set_union2(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_60) ).
cnf(i_0_55,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_55) ).
cnf(i_0_56,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0nbe8b2o/input.p',i_0_56) ).
cnf(c_0_72,plain,
( preboolean(X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(symmetric_difference(esk11_1(X1),symmetric_difference(symmetric_difference(esk11_1(X1),esk12_1(X1)),set_union2(esk11_1(X1),esk12_1(X1)))),X1) ),
i_0_54 ).
cnf(c_0_73,negated_conjecture,
( in(symmetric_difference(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
i_0_61 ).
cnf(c_0_74,negated_conjecture,
~ preboolean(esk13_0),
i_0_59 ).
cnf(c_0_75,negated_conjecture,
( ~ in(set_union2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(symmetric_difference(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),set_union2(esk11_1(esk13_0),esk12_1(esk13_0))),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_76,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_64 ).
cnf(c_0_77,plain,
( ~ in(symmetric_difference(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),set_union2(esk11_1(esk13_0),esk12_1(esk13_0))),esk13_0)
| ~ in(set_union2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,negated_conjecture,
( ~ in(set_union2(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_73]),c_0_76]) ).
cnf(c_0_79,negated_conjecture,
( in(set_union2(X1,X2),esk13_0)
| ~ element(X2,esk13_0)
| ~ element(X1,esk13_0) ),
i_0_60 ).
cnf(c_0_80,negated_conjecture,
( ~ element(symmetric_difference(esk11_1(esk13_0),esk12_1(esk13_0)),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(esk12_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_81,plain,
( ~ element(esk11_1(esk13_0),esk13_0)
| ~ element(esk12_1(esk13_0),esk13_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_76]),c_0_73]) ).
cnf(c_0_82,plain,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ element(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_76]) ).
cnf(c_0_83,plain,
( ~ in(esk12_1(esk13_0),esk13_0)
| ~ in(esk11_1(esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_76]) ).
cnf(c_0_84,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
i_0_55 ).
cnf(c_0_85,plain,
~ in(esk11_1(esk13_0),esk13_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_74]) ).
cnf(c_0_86,plain,
( preboolean(X1)
| in(esk11_1(X1),X1) ),
i_0_56 ).
cnf(c_0_87,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU106+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 12:12:57 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 7.53/2.29 # ENIGMATIC: Solved by autoschedule:
% 7.53/2.29 # No SInE strategy applied
% 7.53/2.29 # Trying AutoSched0 for 150 seconds
% 7.53/2.29 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.53/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.53/2.29 #
% 7.53/2.29 # Preprocessing time : 0.021 s
% 7.53/2.29
% 7.53/2.29 # Proof found!
% 7.53/2.29 # SZS status Theorem
% 7.53/2.29 # SZS output start CNFRefutation
% See solution above
% 7.53/2.29 # Training examples: 0 positive, 0 negative
% 7.53/2.29
% 7.53/2.29 # -------------------------------------------------
% 7.53/2.29 # User time : 0.028 s
% 7.53/2.29 # System time : 0.005 s
% 7.53/2.29 # Total time : 0.033 s
% 7.53/2.29 # Maximum resident set size: 7120 pages
% 7.53/2.29
%------------------------------------------------------------------------------