%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:40:15 EDT 2022
% Result : Theorem 8.14s 2.52s
% Output : CNFRefutation 8.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 3 nHn; 15 RR)
% Number of literals : 62 ( 11 equ; 36 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 41 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_23) ).
cnf(i_0_30,plain,
relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_30) ).
cnf(i_0_14,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-elf93u8x/lgb.p',i_0_14) ).
cnf(i_0_12,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_12) ).
cnf(i_0_21,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_21) ).
cnf(i_0_15,plain,
( is_reflexive_in(X1,X2)
| in(esk1_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_15) ).
cnf(i_0_26,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_26) ).
cnf(i_0_80,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_80) ).
cnf(i_0_84,negated_conjecture,
~ reflexive(inclusion_relation(esk14_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-elf93u8x/lgb.p',i_0_84) ).
cnf(c_0_94,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
i_0_23 ).
cnf(c_0_95,plain,
relation(inclusion_relation(X1)),
i_0_30 ).
cnf(c_0_96,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_14 ).
cnf(c_0_97,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_12 ).
cnf(c_0_98,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ subset(X1,X2) ),
i_0_21 ).
cnf(c_0_99,plain,
( is_reflexive_in(X1,X2)
| in(esk1_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_15 ).
cnf(c_0_100,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
i_0_26 ).
cnf(c_0_101,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_94]),c_0_95])]) ).
cnf(c_0_102,plain,
( is_reflexive_in(X1,X2)
| ~ in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_103,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_2(X2,X3))),X4)
| is_reflexive_in(X2,X3)
| X4 != inclusion_relation(X3)
| ~ subset(X1,esk1_2(X2,X3))
| ~ in(X1,X3)
| ~ relation(X4)
| ~ relation(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_97]) ).
cnf(c_0_104,plain,
subset(X1,X1),
i_0_80 ).
cnf(c_0_105,plain,
( reflexive(inclusion_relation(X1))
| ~ is_reflexive_in(inclusion_relation(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_95])]) ).
cnf(c_0_106,plain,
( is_reflexive_in(X1,X2)
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104])]),c_0_99]) ).
cnf(c_0_107,negated_conjecture,
~ reflexive(inclusion_relation(esk14_0)),
i_0_84 ).
cnf(c_0_108,plain,
reflexive(inclusion_relation(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_95])]) ).
cnf(c_0_109,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n027.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 04:50:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.14/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.14/2.52 # No SInE strategy applied
% 8.14/2.52 # Trying AutoSched0 for 150 seconds
% 8.14/2.52 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.14/2.52 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.14/2.52 #
% 8.14/2.52 # Preprocessing time : 0.013 s
% 8.14/2.52
% 8.14/2.52 # Proof found!
% 8.14/2.52 # SZS status Theorem
% 8.14/2.52 # SZS output start CNFRefutation
% See solution above
% 8.14/2.52 # Training examples: 0 positive, 0 negative
% 8.14/2.52
% 8.14/2.52 # -------------------------------------------------
% 8.14/2.52 # User time : 0.018 s
% 8.14/2.52 # System time : 0.003 s
% 8.14/2.52 # Total time : 0.021 s
% 8.14/2.52 # Maximum resident set size: 7124 pages
% 8.14/2.52
%------------------------------------------------------------------------------