TSTP Solution File: SEU224+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU224+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:39:45 EDT 2022
% Result : Theorem 8.18s 2.58s
% Output : CNFRefutation 8.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 11 unt; 4 nHn; 30 RR)
% Number of literals : 92 ( 14 equ; 54 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_12) ).
cnf(i_0_63,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_63) ).
cnf(i_0_28,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_28) ).
cnf(i_0_18,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_18) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_13) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_11) ).
cnf(i_0_36,negated_conjecture,
( in(esk4_0,esk3_0)
| in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_36) ).
cnf(i_0_40,negated_conjecture,
relation(esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_40) ).
cnf(i_0_39,negated_conjecture,
function(esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_39) ).
cnf(i_0_37,negated_conjecture,
( in(esk4_0,relation_dom(esk5_0))
| in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_37) ).
cnf(i_0_38,negated_conjecture,
( ~ in(esk4_0,esk3_0)
| ~ in(esk4_0,relation_dom(esk5_0))
| ~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_38) ).
cnf(i_0_7,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i8hoar8j/lgb.p',i_0_7) ).
cnf(c_0_76,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_77,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_63 ).
cnf(c_0_78,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_28 ).
cnf(c_0_79,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_18 ).
cnf(c_0_80,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_81,plain,
( set_intersection2(relation_dom(X1),X2) = relation_dom(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_77]),c_0_78]),c_0_79]) ).
cnf(c_0_82,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_83,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_84,plain,
( in(X1,X2)
| ~ relation(X3)
| ~ function(X3)
| ~ in(X1,relation_dom(relation_dom_restriction(X3,X2))) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,negated_conjecture,
( in(esk4_0,esk3_0)
| in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
i_0_36 ).
cnf(c_0_86,negated_conjecture,
relation(esk5_0),
i_0_40 ).
cnf(c_0_87,negated_conjecture,
function(esk5_0),
i_0_39 ).
cnf(c_0_88,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_89,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_83]) ).
cnf(c_0_90,negated_conjecture,
in(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87])]) ).
cnf(c_0_91,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
inference(spm,[status(thm)],[c_0_88,c_0_81]) ).
cnf(c_0_92,negated_conjecture,
( in(esk4_0,relation_dom(esk5_0))
| in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
i_0_37 ).
cnf(c_0_93,negated_conjecture,
( ~ in(esk4_0,esk3_0)
| ~ in(esk4_0,relation_dom(esk5_0))
| ~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
i_0_38 ).
cnf(c_0_94,plain,
( in(esk4_0,set_intersection2(X1,esk3_0))
| ~ in(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
in(esk4_0,relation_dom(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_86]),c_0_87])]) ).
cnf(c_0_96,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_7 ).
cnf(c_0_97,negated_conjecture,
( ~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))
| ~ in(esk4_0,relation_dom(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_90])]) ).
cnf(c_0_98,plain,
in(esk4_0,set_intersection2(esk3_0,relation_dom(esk5_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_99,plain,
( set_intersection2(X1,relation_dom(X2)) = relation_dom(relation_dom_restriction(X2,X1))
| ~ relation(X2)
| ~ function(X2) ),
inference(spm,[status(thm)],[c_0_96,c_0_81]) ).
cnf(c_0_100,negated_conjecture,
~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_95])]) ).
cnf(c_0_101,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_86]),c_0_87])]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU224+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 07:58:20 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 8.18/2.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.18/2.58 # No SInE strategy applied
% 8.18/2.58 # Trying AutoSched0 for 150 seconds
% 8.18/2.58 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.18/2.58 # and selection function SelectNewComplexAHP.
% 8.18/2.58 #
% 8.18/2.58 # Preprocessing time : 0.021 s
% 8.18/2.58 # Presaturation interreduction done
% 8.18/2.58
% 8.18/2.58 # Proof found!
% 8.18/2.58 # SZS status Theorem
% 8.18/2.58 # SZS output start CNFRefutation
% See solution above
% 8.18/2.58 # Training examples: 0 positive, 0 negative
% 8.18/2.58
% 8.18/2.58 # -------------------------------------------------
% 8.18/2.58 # User time : 0.023 s
% 8.18/2.58 # System time : 0.010 s
% 8.18/2.58 # Total time : 0.033 s
% 8.18/2.58 # Maximum resident set size: 7124 pages
% 8.18/2.58
%------------------------------------------------------------------------------