TSTP Solution File: SEU239+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:58 EDT 2022
% Result : Theorem 4.57s 2.27s
% Output : CNFRefutation 4.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 8 unt; 8 nHn; 29 RR)
% Number of literals : 78 ( 2 equ; 39 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( is_reflexive_in(X1,X2)
| in(esk1_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_9) ).
cnf(i_0_33,negated_conjecture,
relation(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_33) ).
cnf(i_0_13,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_13) ).
cnf(i_0_8,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),singleton(esk1_2(X1,X2))),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_8) ).
cnf(i_0_6,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_6) ).
cnf(i_0_32,negated_conjecture,
( in(esk4_0,relation_field(esk3_0))
| ~ reflexive(esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_32) ).
cnf(i_0_31,negated_conjecture,
( ~ reflexive(esk3_0)
| ~ in(unordered_pair(unordered_pair(esk4_0,esk4_0),singleton(esk4_0)),esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_31) ).
cnf(i_0_30,negated_conjecture,
( reflexive(esk3_0)
| in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),esk3_0)
| ~ in(X1,relation_field(esk3_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_30) ).
cnf(i_0_10,plain,
( in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X2)
| ~ relation(X2)
| ~ in(X1,X3)
| ~ is_reflexive_in(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_10) ).
cnf(i_0_14,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5jzlnd2y/lgb.p',i_0_14) ).
cnf(c_0_44,plain,
( is_reflexive_in(X1,X2)
| in(esk1_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_9 ).
cnf(c_0_45,negated_conjecture,
relation(esk3_0),
i_0_33 ).
cnf(c_0_46,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
i_0_13 ).
cnf(c_0_47,negated_conjecture,
( is_reflexive_in(esk3_0,X1)
| in(esk1_2(esk3_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),singleton(esk1_2(X1,X2))),X1) ),
i_0_8 ).
cnf(c_0_49,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_6 ).
cnf(c_0_50,negated_conjecture,
( in(esk4_0,relation_field(esk3_0))
| ~ reflexive(esk3_0) ),
i_0_32 ).
cnf(c_0_51,plain,
( in(esk1_2(esk3_0,relation_field(esk3_0)),relation_field(esk3_0))
| reflexive(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_45])]) ).
cnf(c_0_52,negated_conjecture,
( ~ reflexive(esk3_0)
| ~ in(unordered_pair(unordered_pair(esk4_0,esk4_0),singleton(esk4_0)),esk3_0) ),
i_0_31 ).
cnf(c_0_53,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1) ),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( reflexive(esk3_0)
| in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),esk3_0)
| ~ in(X1,relation_field(esk3_0)) ),
i_0_30 ).
cnf(c_0_55,negated_conjecture,
( in(esk1_2(esk3_0,relation_field(esk3_0)),relation_field(esk3_0))
| in(esk4_0,relation_field(esk3_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( in(esk1_2(esk3_0,relation_field(esk3_0)),relation_field(esk3_0))
| ~ in(unordered_pair(unordered_pair(esk4_0,esk4_0),singleton(esk4_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_57,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk1_2(X1,relation_field(X1))),unordered_pair(esk1_2(X1,relation_field(X1)),esk1_2(X1,relation_field(X1)))),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( in(unordered_pair(singleton(esk1_2(esk3_0,relation_field(esk3_0))),unordered_pair(esk1_2(esk3_0,relation_field(esk3_0)),esk1_2(esk3_0,relation_field(esk3_0)))),esk3_0)
| in(esk4_0,relation_field(esk3_0)) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]),c_0_50]) ).
cnf(c_0_59,negated_conjecture,
( in(unordered_pair(singleton(esk1_2(esk3_0,relation_field(esk3_0))),unordered_pair(esk1_2(esk3_0,relation_field(esk3_0)),esk1_2(esk3_0,relation_field(esk3_0)))),esk3_0)
| ~ in(unordered_pair(unordered_pair(esk4_0,esk4_0),singleton(esk4_0)),esk3_0) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_56]),c_0_49]),c_0_52]) ).
cnf(c_0_60,plain,
( in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X2)
| ~ relation(X2)
| ~ in(X1,X3)
| ~ is_reflexive_in(X2,X3) ),
i_0_10 ).
cnf(c_0_61,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
i_0_14 ).
cnf(c_0_62,negated_conjecture,
in(esk4_0,relation_field(esk3_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_57]),c_0_45])]),c_0_58]) ).
cnf(c_0_63,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk4_0,esk4_0),singleton(esk4_0)),esk3_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_57]),c_0_45])]),c_0_59]) ).
cnf(c_0_64,plain,
( in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X2)
| ~ relation(X2)
| ~ in(X1,relation_field(X2))
| ~ reflexive(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
reflexive(esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_62]),c_0_63]) ).
cnf(c_0_66,plain,
( in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),esk3_0)
| ~ in(X1,relation_field(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_45])]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_66]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU239+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 23:48:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.57/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.57/2.27 # No SInE strategy applied
% 4.57/2.27 # Trying AutoSched0 for 150 seconds
% 4.57/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 4.57/2.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.57/2.27 #
% 4.57/2.27 # Preprocessing time : 0.023 s
% 4.57/2.27 # Presaturation interreduction done
% 4.57/2.27
% 4.57/2.27 # Proof found!
% 4.57/2.27 # SZS status Theorem
% 4.57/2.27 # SZS output start CNFRefutation
% See solution above
% 4.57/2.27 # Training examples: 0 positive, 0 negative
% 4.57/2.27
% 4.57/2.27 # -------------------------------------------------
% 4.57/2.27 # User time : 0.025 s
% 4.57/2.27 # System time : 0.007 s
% 4.57/2.27 # Total time : 0.033 s
% 4.57/2.27 # Maximum resident set size: 7124 pages
% 4.57/2.27
%------------------------------------------------------------------------------