TSTP Solution File: SEU142+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:38:47 EDT 2022
% Result : Theorem 8.35s 2.48s
% Output : CNFRefutation 8.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 7 unt; 7 nHn; 19 RR)
% Number of literals : 54 ( 29 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_12) ).
cnf(i_0_94,negated_conjecture,
unordered_pair(esk13_0,esk13_0) != singleton(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_94) ).
cnf(i_0_73,plain,
( X1 = X2
| in(esk10_2(X1,X2),X2)
| in(esk10_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_73) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_11) ).
cnf(i_0_19,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_19) ).
cnf(i_0_20,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_20) ).
cnf(i_0_74,plain,
( X1 = X2
| ~ in(esk10_2(X1,X2),X2)
| ~ in(esk10_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xtzvip9/lgb.p',i_0_74) ).
cnf(c_0_102,plain,
( X1 = X2
| X3 != singleton(X2)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_103,negated_conjecture,
unordered_pair(esk13_0,esk13_0) != singleton(esk13_0),
i_0_94 ).
cnf(c_0_104,plain,
( X1 = X2
| in(esk10_2(X1,X2),X2)
| in(esk10_2(X1,X2),X1) ),
i_0_73 ).
cnf(c_0_105,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_102]) ).
cnf(c_0_106,negated_conjecture,
( in(esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)),unordered_pair(esk13_0,esk13_0))
| in(esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)),singleton(esk13_0)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104])]) ).
cnf(c_0_107,plain,
( in(X1,X2)
| X1 != X3
| X2 != singleton(X3) ),
i_0_11 ).
cnf(c_0_108,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_19 ).
cnf(c_0_109,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_20 ).
cnf(c_0_110,plain,
( X1 = X2
| ~ in(esk10_2(X1,X2),X2)
| ~ in(esk10_2(X1,X2),X1) ),
i_0_74 ).
cnf(c_0_111,plain,
( esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)) = esk13_0
| in(esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)),unordered_pair(esk13_0,esk13_0)) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_112,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_107])]) ).
cnf(c_0_113,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_108])]) ).
cnf(c_0_114,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_109]) ).
cnf(c_0_115,plain,
in(esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)),unordered_pair(esk13_0,esk13_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_113])]),c_0_103]) ).
cnf(c_0_116,plain,
esk10_2(unordered_pair(esk13_0,esk13_0),singleton(esk13_0)) = esk13_0,
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_117,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_116]),c_0_112]),c_0_113])]),c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 21:04:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.35/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.35/2.48 # No SInE strategy applied
% 8.35/2.48 # Trying AutoSched0 for 150 seconds
% 8.35/2.48 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.35/2.48 # and selection function SelectLargestNegLit.
% 8.35/2.48 #
% 8.35/2.48 # Preprocessing time : 0.024 s
% 8.35/2.48 # Presaturation interreduction done
% 8.35/2.48
% 8.35/2.48 # Proof found!
% 8.35/2.48 # SZS status Theorem
% 8.35/2.48 # SZS output start CNFRefutation
% See solution above
% 8.35/2.48 # Training examples: 0 positive, 0 negative
% 8.35/2.48
% 8.35/2.48 # -------------------------------------------------
% 8.35/2.48 # User time : 0.057 s
% 8.35/2.48 # System time : 0.006 s
% 8.35/2.48 # Total time : 0.063 s
% 8.35/2.48 # Maximum resident set size: 7124 pages
% 8.35/2.48
%------------------------------------------------------------------------------