TSTP Solution File: SEU103+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:28 EDT 2022
% Result : Theorem 11.35s 3.77s
% Output : CNFRefutation 11.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 12 unt; 8 nHn; 29 RR)
% Number of literals : 73 ( 7 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_12) ).
cnf(i_0_57,negated_conjecture,
element(esk11_0,esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_57) ).
cnf(i_0_58,negated_conjecture,
preboolean(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_58) ).
cnf(i_0_59,negated_conjecture,
~ empty(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_59) ).
cnf(i_0_53,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_53) ).
cnf(i_0_11,plain,
( empty(X1)
| element(prebool_union2(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_11) ).
cnf(i_0_52,plain,
( prebool_union2(X1,X2,X3) = set_union2(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_52) ).
cnf(i_0_56,negated_conjecture,
element(esk12_0,esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_56) ).
cnf(i_0_55,negated_conjecture,
~ element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-obylho9e/input.p',i_0_55) ).
cnf(c_0_69,plain,
( empty(X1)
| element(prebool_difference(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_12 ).
cnf(c_0_70,negated_conjecture,
element(esk11_0,esk13_0),
i_0_57 ).
cnf(c_0_71,negated_conjecture,
preboolean(esk13_0),
i_0_58 ).
cnf(c_0_72,negated_conjecture,
~ empty(esk13_0),
i_0_59 ).
cnf(c_0_73,plain,
( prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_53 ).
cnf(c_0_74,negated_conjecture,
( element(prebool_difference(esk13_0,X1,esk11_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),c_0_72]) ).
cnf(c_0_75,negated_conjecture,
( prebool_difference(esk13_0,X1,esk11_0) = set_difference(X1,esk11_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_71])]),c_0_72]) ).
cnf(c_0_76,plain,
( empty(X1)
| element(prebool_union2(X1,X2,X3),X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_11 ).
cnf(c_0_77,negated_conjecture,
( element(set_difference(X1,esk11_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
( prebool_union2(X1,X2,X3) = set_union2(X2,X3)
| empty(X1)
| ~ preboolean(X1)
| ~ element(X3,X1)
| ~ element(X2,X1) ),
i_0_52 ).
cnf(c_0_79,plain,
( element(prebool_union2(esk13_0,X1,set_difference(X2,esk11_0)),esk13_0)
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_71])]),c_0_72]) ).
cnf(c_0_80,plain,
( prebool_union2(esk13_0,X1,set_difference(X2,esk11_0)) = set_union2(X1,set_difference(X2,esk11_0))
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_77]),c_0_71])]),c_0_72]) ).
cnf(c_0_81,negated_conjecture,
element(esk12_0,esk13_0),
i_0_56 ).
cnf(c_0_82,negated_conjecture,
~ element(set_union2(set_difference(esk11_0,esk12_0),set_difference(esk12_0,esk11_0)),esk13_0),
i_0_55 ).
cnf(c_0_83,plain,
( element(set_union2(X1,set_difference(X2,esk11_0)),esk13_0)
| ~ element(X1,esk13_0)
| ~ element(X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( element(prebool_difference(esk13_0,X1,esk12_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_81]),c_0_71])]),c_0_72]) ).
cnf(c_0_85,negated_conjecture,
( prebool_difference(esk13_0,X1,esk12_0) = set_difference(X1,esk12_0)
| ~ element(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_81]),c_0_71])]),c_0_72]) ).
cnf(c_0_86,negated_conjecture,
~ element(set_difference(esk11_0,esk12_0),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_81])]) ).
cnf(c_0_87,negated_conjecture,
( element(set_difference(X1,esk12_0),esk13_0)
| ~ element(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU103+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.35 % Computer : n029.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 600
% 0.12/0.35 % DateTime : Sun Jun 19 08:38:31 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 11.35/3.77 # ENIGMATIC: Solved by autoschedule:
% 11.35/3.77 # No SInE strategy applied
% 11.35/3.77 # Trying AutoSched0 for 150 seconds
% 11.35/3.77 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 11.35/3.77 # and selection function SelectComplexExceptUniqMaxHorn.
% 11.35/3.77 #
% 11.35/3.77 # Preprocessing time : 0.021 s
% 11.35/3.77 # Presaturation interreduction done
% 11.35/3.77
% 11.35/3.77 # Proof found!
% 11.35/3.77 # SZS status Theorem
% 11.35/3.77 # SZS output start CNFRefutation
% See solution above
% 11.35/3.77 # Training examples: 0 positive, 0 negative
% 11.35/3.77
% 11.35/3.77 # -------------------------------------------------
% 11.35/3.77 # User time : 0.654 s
% 11.35/3.77 # System time : 0.020 s
% 11.35/3.77 # Total time : 0.675 s
% 11.35/3.77 # Maximum resident set size: 7116 pages
% 11.35/3.77
%------------------------------------------------------------------------------