TSTP Solution File: SEU008+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU008+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:37:59 EDT 2022
% Result : Theorem 7.87s 2.47s
% Output : CNFRefutation 7.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 18 unt; 0 nHn; 22 RR)
% Number of literals : 67 ( 21 equ; 40 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_10) ).
cnf(i_0_58,negated_conjecture,
in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_58) ).
cnf(i_0_4,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_4) ).
cnf(i_0_55,plain,
( apply(X1,X2) = X2
| X1 != identity_relation(X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_55) ).
cnf(i_0_50,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_50) ).
cnf(i_0_56,plain,
( relation_dom(X1) = X2
| X1 != identity_relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_56) ).
cnf(i_0_12,plain,
relation(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_12) ).
cnf(i_0_24,plain,
function(identity_relation(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_24) ).
cnf(i_0_57,negated_conjecture,
apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0) != apply(esk14_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_57) ).
cnf(i_0_60,negated_conjecture,
relation(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_60) ).
cnf(i_0_59,negated_conjecture,
function(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4itaxx33/input.p',i_0_59) ).
cnf(c_0_72,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_73,negated_conjecture,
in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0)),
i_0_58 ).
cnf(c_0_74,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_4 ).
cnf(c_0_75,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_76,negated_conjecture,
in(esk13_0,set_intersection2(esk12_0,relation_dom(esk14_0))),
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,plain,
( apply(X1,X2) = X2
| X1 != identity_relation(X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,X3) ),
i_0_55 ).
cnf(c_0_78,plain,
in(esk13_0,esk12_0),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
i_0_50 ).
cnf(c_0_80,plain,
( apply(X1,esk13_0) = esk13_0
| X1 != identity_relation(esk12_0)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
( relation_dom(X1) = X2
| X1 != identity_relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
i_0_56 ).
cnf(c_0_82,plain,
relation(identity_relation(X1)),
i_0_12 ).
cnf(c_0_83,plain,
function(identity_relation(X1)),
i_0_24 ).
cnf(c_0_84,negated_conjecture,
apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0) != apply(esk14_0,esk13_0),
i_0_57 ).
cnf(c_0_85,plain,
( apply(relation_composition(X1,X2),esk13_0) = apply(X2,esk13_0)
| X1 != identity_relation(esk12_0)
| ~ in(esk13_0,relation_dom(X1))
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
relation_dom(identity_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_81]),c_0_82]),c_0_83])]) ).
cnf(c_0_87,negated_conjecture,
relation(esk14_0),
i_0_60 ).
cnf(c_0_88,negated_conjecture,
function(esk14_0),
i_0_59 ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_78]),c_0_87]),c_0_82]),c_0_88]),c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU008+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 : n017.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 : Mon Jun 20 02:27:30 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.87/2.47 # ENIGMATIC: Solved by autoschedule:
% 7.87/2.47 # No SInE strategy applied
% 7.87/2.47 # Trying AutoSched0 for 150 seconds
% 7.87/2.47 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.87/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.87/2.47 #
% 7.87/2.47 # Preprocessing time : 0.024 s
% 7.87/2.47
% 7.87/2.47 # Proof found!
% 7.87/2.47 # SZS status Theorem
% 7.87/2.47 # SZS output start CNFRefutation
% See solution above
% 7.87/2.47 # Training examples: 0 positive, 0 negative
% 7.87/2.47
% 7.87/2.47 # -------------------------------------------------
% 7.87/2.47 # User time : 0.086 s
% 7.87/2.47 # System time : 0.012 s
% 7.87/2.47 # Total time : 0.098 s
% 7.87/2.47 # Maximum resident set size: 7124 pages
% 7.87/2.47
%------------------------------------------------------------------------------