TSTP Solution File: NUM414+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM414+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 : Mon Jul 18 08:35:45 EDT 2022
% Result : Theorem 7.95s 2.44s
% Output : CNFRefutation 7.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 12 unt; 8 nHn; 22 RR)
% Number of literals : 43 ( 4 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_14) ).
cnf(i_0_85,negated_conjecture,
ordinal(esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_85) ).
cnf(i_0_86,negated_conjecture,
ordinal(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_86) ).
cnf(i_0_74,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_74) ).
cnf(i_0_15,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_15) ).
cnf(i_0_83,negated_conjecture,
esk17_0 != esk16_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_83) ).
cnf(i_0_82,negated_conjecture,
~ proper_subset(esk17_0,esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_82) ).
cnf(i_0_84,negated_conjecture,
~ proper_subset(esk16_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2z867y6r/input.p',i_0_84) ).
cnf(c_0_95,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
i_0_14 ).
cnf(c_0_96,negated_conjecture,
ordinal(esk17_0),
i_0_85 ).
cnf(c_0_97,negated_conjecture,
( ordinal_subset(esk17_0,X1)
| ordinal_subset(X1,esk17_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,negated_conjecture,
ordinal(esk16_0),
i_0_86 ).
cnf(c_0_99,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_74 ).
cnf(c_0_100,negated_conjecture,
( ordinal_subset(esk16_0,esk17_0)
| ordinal_subset(esk17_0,esk16_0) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,plain,
( ordinal_subset(esk16_0,esk17_0)
| subset(esk17_0,esk16_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_98]),c_0_96])]) ).
cnf(c_0_102,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
i_0_15 ).
cnf(c_0_103,plain,
( subset(esk17_0,esk16_0)
| subset(esk16_0,esk17_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_101]),c_0_96]),c_0_98])]) ).
cnf(c_0_104,negated_conjecture,
esk17_0 != esk16_0,
i_0_83 ).
cnf(c_0_105,negated_conjecture,
~ proper_subset(esk17_0,esk16_0),
i_0_82 ).
cnf(c_0_106,plain,
subset(esk16_0,esk17_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105]) ).
cnf(c_0_107,negated_conjecture,
~ proper_subset(esk16_0,esk17_0),
i_0_84 ).
cnf(c_0_108,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_106]),c_0_104]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM414+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n008.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 : Tue Jul 5 18:45:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.95/2.44 # ENIGMATIC: Solved by autoschedule:
% 7.95/2.44 # No SInE strategy applied
% 7.95/2.44 # Trying AutoSched0 for 150 seconds
% 7.95/2.44 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.95/2.44 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.95/2.44 #
% 7.95/2.44 # Preprocessing time : 0.024 s
% 7.95/2.44
% 7.95/2.44 # Proof found!
% 7.95/2.44 # SZS status Theorem
% 7.95/2.44 # SZS output start CNFRefutation
% See solution above
% 7.95/2.44 # Training examples: 0 positive, 0 negative
% 7.95/2.44
% 7.95/2.44 # -------------------------------------------------
% 7.95/2.44 # User time : 0.027 s
% 7.95/2.44 # System time : 0.005 s
% 7.95/2.44 # Total time : 0.032 s
% 7.95/2.44 # Maximum resident set size: 7124 pages
% 7.95/2.44
%------------------------------------------------------------------------------