TSTP Solution File: SEU199+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU199+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:26 EDT 2022
% Result : Theorem 7.97s 2.53s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 10 unt; 6 nHn; 20 RR)
% Number of literals : 64 ( 4 equ; 36 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( subset(X1,X2)
| in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_11) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_3) ).
cnf(i_0_41,negated_conjecture,
relation(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_41) ).
cnf(i_0_19,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_19) ).
cnf(i_0_8,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-0nmyfrn1/lgb.p',i_0_8) ).
cnf(i_0_10,plain,
( subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_10) ).
cnf(i_0_40,negated_conjecture,
~ subset(relation_rng_restriction(esk12_0,esk13_0),esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0nmyfrn1/lgb.p',i_0_40) ).
cnf(c_0_49,plain,
( subset(X1,X2)
| in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_11 ).
cnf(c_0_50,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_51,plain,
( in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X1)
| subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
relation(esk13_0),
i_0_41 ).
cnf(c_0_53,negated_conjecture,
( in(unordered_pair(singleton(esk3_2(X1,esk13_0)),unordered_pair(esk3_2(X1,esk13_0),esk4_2(X1,esk13_0))),X1)
| subset(X1,esk13_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_19 ).
cnf(c_0_55,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_8 ).
cnf(c_0_56,plain,
( in(unordered_pair(singleton(esk3_2(relation_rng_restriction(X1,X2),esk13_0)),unordered_pair(esk3_2(relation_rng_restriction(X1,X2),esk13_0),esk4_2(relation_rng_restriction(X1,X2),esk13_0))),relation_rng_restriction(X1,X2))
| subset(relation_rng_restriction(X1,X2),esk13_0)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( subset(X1,X2)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X2) ),
i_0_10 ).
cnf(c_0_58,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),relation_rng_restriction(X4,X3))
| ~ relation(X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_54]) ).
cnf(c_0_59,negated_conjecture,
~ subset(relation_rng_restriction(esk12_0,esk13_0),esk13_0),
i_0_40 ).
cnf(c_0_60,negated_conjecture,
( in(unordered_pair(singleton(esk3_2(relation_rng_restriction(X1,esk13_0),esk13_0)),unordered_pair(esk3_2(relation_rng_restriction(X1,esk13_0),esk13_0),esk4_2(relation_rng_restriction(X1,esk13_0),esk13_0))),relation_rng_restriction(X1,esk13_0))
| subset(relation_rng_restriction(X1,esk13_0),esk13_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_52]) ).
cnf(c_0_61,plain,
( subset(X1,X2)
| ~ in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X2)
| ~ relation(X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_57,c_0_50]) ).
cnf(c_0_62,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),relation_rng_restriction(X4,X3))
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_58,c_0_50]) ).
cnf(c_0_63,negated_conjecture,
in(unordered_pair(singleton(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0)),unordered_pair(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0),esk4_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0))),relation_rng_restriction(esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( ~ in(unordered_pair(singleton(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0)),unordered_pair(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0),esk4_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0))),esk13_0)
| ~ relation(relation_rng_restriction(esk12_0,esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_61]),c_0_52])]) ).
cnf(c_0_65,plain,
in(unordered_pair(singleton(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0)),unordered_pair(esk3_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0),esk4_2(relation_rng_restriction(esk12_0,esk13_0),esk13_0))),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_52])]) ).
cnf(c_0_66,negated_conjecture,
~ relation(relation_rng_restriction(esk12_0,esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_67,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_54]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU199+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 01:13:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 7.97/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.97/2.53 # No SInE strategy applied
% 7.97/2.53 # Trying AutoSched0 for 150 seconds
% 7.97/2.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 7.97/2.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.97/2.53 #
% 7.97/2.53 # Preprocessing time : 0.023 s
% 7.97/2.53 # Presaturation interreduction done
% 7.97/2.53
% 7.97/2.53 # Proof found!
% 7.97/2.53 # SZS status Theorem
% 7.97/2.53 # SZS output start CNFRefutation
% See solution above
% 7.97/2.53 # Training examples: 0 positive, 0 negative
% 7.97/2.53
% 7.97/2.53 # -------------------------------------------------
% 7.97/2.53 # User time : 0.059 s
% 7.97/2.53 # System time : 0.012 s
% 7.97/2.53 # Total time : 0.071 s
% 7.97/2.53 # Maximum resident set size: 7128 pages
% 7.97/2.53
%------------------------------------------------------------------------------