TSTP Solution File: SEU180+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:15 EDT 2022
% Result : Theorem 7.26s 2.34s
% Output : CNFRefutation 7.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 9 unt; 0 nHn; 26 RR)
% Number of literals : 60 ( 14 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_7) ).
cnf(i_0_16,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_16) ).
cnf(i_0_46,negated_conjecture,
in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_46) ).
cnf(i_0_47,negated_conjecture,
relation(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_47) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_12) ).
cnf(i_0_19,plain,
( set_union2(relation_dom(X1),relation_rng(X1)) = relation_field(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_19) ).
cnf(i_0_8,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_8) ).
cnf(i_0_45,negated_conjecture,
( ~ in(esk12_0,relation_field(esk14_0))
| ~ in(esk13_0,relation_field(esk14_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-53is3s1x/lgb.p',i_0_45) ).
cnf(c_0_56,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_7 ).
cnf(c_0_57,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3) ),
i_0_16 ).
cnf(c_0_58,negated_conjecture,
in(unordered_pair(unordered_pair(esk12_0,esk13_0),singleton(esk12_0)),esk14_0),
i_0_46 ).
cnf(c_0_59,negated_conjecture,
relation(esk14_0),
i_0_47 ).
cnf(c_0_60,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
i_0_12 ).
cnf(c_0_61,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_62,plain,
( set_union2(relation_dom(X1),relation_rng(X1)) = relation_field(X1)
| ~ relation(X1) ),
i_0_19 ).
cnf(c_0_63,negated_conjecture,
( in(esk13_0,X1)
| X1 != relation_rng(esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_64,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_8 ).
cnf(c_0_65,negated_conjecture,
( in(esk12_0,X1)
| X1 != relation_dom(esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_58]),c_0_59])]) ).
cnf(c_0_66,plain,
( in(X1,relation_field(X2))
| ~ relation(X2)
| ~ in(X1,relation_rng(X2)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
in(esk13_0,relation_rng(esk14_0)),
inference(er,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
( in(X1,X2)
| X2 != relation_field(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3)) ),
inference(spm,[status(thm)],[c_0_64,c_0_62]) ).
cnf(c_0_69,negated_conjecture,
in(esk12_0,relation_dom(esk14_0)),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( ~ in(esk12_0,relation_field(esk14_0))
| ~ in(esk13_0,relation_field(esk14_0)) ),
i_0_45 ).
cnf(c_0_71,negated_conjecture,
in(esk13_0,relation_field(esk14_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59])]) ).
cnf(c_0_72,negated_conjecture,
( in(esk12_0,X1)
| X1 != relation_field(esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_59])]) ).
cnf(c_0_73,negated_conjecture,
~ in(esk12_0,relation_field(esk14_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU180+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 05:33:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.26/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.26/2.34 # No SInE strategy applied
% 7.26/2.34 # Trying AutoSched0 for 150 seconds
% 7.26/2.34 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.26/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.26/2.34 #
% 7.26/2.34 # Preprocessing time : 0.012 s
% 7.26/2.34
% 7.26/2.34 # Proof found!
% 7.26/2.34 # SZS status Theorem
% 7.26/2.34 # SZS output start CNFRefutation
% See solution above
% 7.26/2.34 # Training examples: 0 positive, 0 negative
% 7.26/2.34
% 7.26/2.34 # -------------------------------------------------
% 7.26/2.34 # User time : 0.017 s
% 7.26/2.34 # System time : 0.004 s
% 7.26/2.34 # Total time : 0.021 s
% 7.26/2.34 # Maximum resident set size: 7124 pages
% 7.26/2.34
%------------------------------------------------------------------------------