TSTP Solution File: SEU248+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU248+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:03 EDT 2022
% Result : Theorem 7.60s 2.48s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 8 unt; 4 nHn; 20 RR)
% Number of literals : 72 ( 8 equ; 41 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 68 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X4 != relation_rng_restriction(X5,X3)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_11) ).
cnf(i_0_27,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_27) ).
cnf(i_0_18,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_18) ).
cnf(i_0_6,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_6) ).
cnf(i_0_19,plain,
( in(unordered_pair(unordered_pair(X1,esk4_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_19) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_14) ).
cnf(i_0_35,negated_conjecture,
relation(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_35) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_13) ).
cnf(i_0_34,negated_conjecture,
~ subset(relation_dom(relation_rng_restriction(esk8_0,esk9_0)),relation_dom(esk9_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rk83blxb/lgb.p',i_0_34) ).
cnf(c_0_45,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X4 != relation_rng_restriction(X5,X3)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X4) ),
i_0_11 ).
cnf(c_0_46,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_27 ).
cnf(c_0_47,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
i_0_18 ).
cnf(c_0_48,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),relation_rng_restriction(X4,X3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_6 ).
cnf(c_0_50,plain,
( in(unordered_pair(unordered_pair(X1,esk4_3(X2,X3,X1)),singleton(X1)),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
i_0_19 ).
cnf(c_0_51,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
| ~ relation(X3)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),relation_rng_restriction(X4,X3)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk4_3(X2,relation_dom(X2),X1))),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).
cnf(c_0_54,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_49]) ).
cnf(c_0_55,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk4_3(relation_rng_restriction(X2,X3),relation_dom(relation_rng_restriction(X2,X3)),X1))),X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(relation_rng_restriction(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_46]) ).
cnf(c_0_56,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_rng_restriction(X3,X2))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_14 ).
cnf(c_0_58,plain,
( in(esk3_2(relation_dom(relation_rng_restriction(X1,X2)),X3),relation_dom(X2))
| subset(relation_dom(relation_rng_restriction(X1,X2)),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
relation(esk9_0),
i_0_35 ).
cnf(c_0_60,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_61,negated_conjecture,
( in(esk3_2(relation_dom(relation_rng_restriction(X1,esk9_0)),X2),relation_dom(esk9_0))
| subset(relation_dom(relation_rng_restriction(X1,esk9_0)),X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
~ subset(relation_dom(relation_rng_restriction(esk8_0,esk9_0)),relation_dom(esk9_0)),
i_0_34 ).
cnf(c_0_63,plain,
subset(relation_dom(relation_rng_restriction(X1,esk9_0)),relation_dom(esk9_0)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU248+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 : n024.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 13:11:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.60/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.48 # No SInE strategy applied
% 7.60/2.48 # Trying AutoSched0 for 150 seconds
% 7.60/2.48 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.60/2.48 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.60/2.48 #
% 7.60/2.48 # Preprocessing time : 0.017 s
% 7.60/2.48 # Presaturation interreduction done
% 7.60/2.48
% 7.60/2.48 # Proof found!
% 7.60/2.48 # SZS status Theorem
% 7.60/2.48 # SZS output start CNFRefutation
% See solution above
% 7.60/2.48 # Training examples: 0 positive, 0 negative
% 7.60/2.48
% 7.60/2.48 # -------------------------------------------------
% 7.60/2.48 # User time : 0.026 s
% 7.60/2.48 # System time : 0.003 s
% 7.60/2.48 # Total time : 0.030 s
% 7.60/2.48 # Maximum resident set size: 7124 pages
% 7.60/2.48
%------------------------------------------------------------------------------