TSTP Solution File: SEU165+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU165+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:04 EDT 2022
% Result : Theorem 9.55s 2.63s
% Output : CNFRefutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 6 unt; 6 nHn; 23 RR)
% Number of literals : 50 ( 2 equ; 24 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_97,lemma,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_97) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_3) ).
cnf(i_0_103,negated_conjecture,
( in(esk20_0,esk22_0)
| in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_103) ).
cnf(i_0_105,negated_conjecture,
( ~ in(esk19_0,esk21_0)
| ~ in(esk20_0,esk22_0)
| ~ in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_105) ).
cnf(i_0_98,lemma,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_98) ).
cnf(i_0_104,negated_conjecture,
( in(esk19_0,esk21_0)
| in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_104) ).
cnf(i_0_96,lemma,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-eg5j_dns/lgb.p',i_0_96) ).
cnf(c_0_113,lemma,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),cartesian_product2(X4,X2)) ),
i_0_97 ).
cnf(c_0_114,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_115,negated_conjecture,
( in(esk20_0,esk22_0)
| in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
i_0_103 ).
cnf(c_0_116,negated_conjecture,
( ~ in(esk19_0,esk21_0)
| ~ in(esk20_0,esk22_0)
| ~ in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
i_0_105 ).
cnf(c_0_117,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_118,negated_conjecture,
( in(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)),cartesian_product2(esk21_0,esk22_0))
| in(esk20_0,esk22_0) ),
inference(rw,[status(thm)],[c_0_115,c_0_114]) ).
cnf(c_0_119,lemma,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),cartesian_product2(X2,X4)) ),
i_0_98 ).
cnf(c_0_120,negated_conjecture,
( in(esk19_0,esk21_0)
| in(unordered_pair(unordered_pair(esk19_0,esk20_0),unordered_pair(esk19_0,esk19_0)),cartesian_product2(esk21_0,esk22_0)) ),
i_0_104 ).
cnf(c_0_121,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)),cartesian_product2(esk21_0,esk22_0))
| ~ in(esk19_0,esk21_0)
| ~ in(esk20_0,esk22_0) ),
inference(rw,[status(thm)],[c_0_116,c_0_114]) ).
cnf(c_0_122,negated_conjecture,
in(esk20_0,esk22_0),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_123,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_119,c_0_114]) ).
cnf(c_0_124,negated_conjecture,
( in(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)),cartesian_product2(esk21_0,esk22_0))
| in(esk19_0,esk21_0) ),
inference(rw,[status(thm)],[c_0_120,c_0_114]) ).
cnf(c_0_125,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)),cartesian_product2(esk21_0,esk22_0))
| ~ in(esk19_0,esk21_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_122])]) ).
cnf(c_0_126,negated_conjecture,
in(esk19_0,esk21_0),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_127,lemma,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_96 ).
cnf(c_0_128,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk19_0,esk19_0),unordered_pair(esk19_0,esk20_0)),cartesian_product2(esk21_0,esk22_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_126])]) ).
cnf(c_0_129,plain,
( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_127,c_0_114]) ).
cnf(c_0_130,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_122]),c_0_126])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU165+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 21:42:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 9.55/2.63 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.55/2.63 # No SInE strategy applied
% 9.55/2.63 # Trying AutoSched0 for 150 seconds
% 9.55/2.63 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S3S
% 9.55/2.63 # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 9.55/2.63 #
% 9.55/2.63 # Preprocessing time : 0.024 s
% 9.55/2.63 # Presaturation interreduction done
% 9.55/2.63
% 9.55/2.63 # Proof found!
% 9.55/2.63 # SZS status Theorem
% 9.55/2.63 # SZS output start CNFRefutation
% See solution above
% 9.55/2.63 # Training examples: 0 positive, 0 negative
% 9.55/2.63
% 9.55/2.63 # -------------------------------------------------
% 9.55/2.63 # User time : 0.079 s
% 9.55/2.63 # System time : 0.013 s
% 9.55/2.63 # Total time : 0.092 s
% 9.55/2.63 # Maximum resident set size: 7124 pages
% 9.55/2.63
%------------------------------------------------------------------------------