TSTP Solution File: NUM410+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM410+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:44 EDT 2022
% Result : Theorem 4.33s 2.08s
% Output : CNFRefutation 4.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 12 unt; 0 nHn; 15 RR)
% Number of literals : 34 ( 0 equ; 19 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( transfinite_sequence_of(X1,X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ subset(relation_rng(X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_15) ).
cnf(i_0_82,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_82) ).
cnf(i_0_13,plain,
( transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ ordinal(relation_dom(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_13) ).
cnf(i_0_88,negated_conjecture,
ordinal(relation_dom(esk17_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_88) ).
cnf(i_0_90,negated_conjecture,
relation(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_90) ).
cnf(i_0_89,negated_conjecture,
function(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_89) ).
cnf(i_0_87,negated_conjecture,
~ transfinite_sequence_of(esk17_0,relation_rng(esk17_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3i8r14e/input.p',i_0_87) ).
cnf(c_0_98,plain,
( transfinite_sequence_of(X1,X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ subset(relation_rng(X1),X2) ),
i_0_15 ).
cnf(c_0_99,plain,
subset(X1,X1),
i_0_82 ).
cnf(c_0_100,plain,
( transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ ordinal(relation_dom(X1)) ),
i_0_13 ).
cnf(c_0_101,negated_conjecture,
ordinal(relation_dom(esk17_0)),
i_0_88 ).
cnf(c_0_102,negated_conjecture,
relation(esk17_0),
i_0_90 ).
cnf(c_0_103,negated_conjecture,
function(esk17_0),
i_0_89 ).
cnf(c_0_104,negated_conjecture,
~ transfinite_sequence_of(esk17_0,relation_rng(esk17_0)),
i_0_87 ).
cnf(c_0_105,plain,
( transfinite_sequence_of(X1,relation_rng(X1))
| ~ transfinite_sequence(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_106,negated_conjecture,
transfinite_sequence(esk17_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]) ).
cnf(c_0_107,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_102]),c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM410+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 15:02:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 4.33/2.08 # ENIGMATIC: Solved by autoschedule:
% 4.33/2.08 # No SInE strategy applied
% 4.33/2.08 # Trying AutoSched0 for 150 seconds
% 4.33/2.08 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 4.33/2.08 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.33/2.08 #
% 4.33/2.08 # Preprocessing time : 0.024 s
% 4.33/2.08
% 4.33/2.08 # Proof found!
% 4.33/2.08 # SZS status Theorem
% 4.33/2.08 # SZS output start CNFRefutation
% See solution above
% 4.33/2.08 # Training examples: 0 positive, 0 negative
% 4.33/2.08
% 4.33/2.08 # -------------------------------------------------
% 4.33/2.08 # User time : 0.032 s
% 4.33/2.08 # System time : 0.002 s
% 4.33/2.08 # Total time : 0.034 s
% 4.33/2.08 # Maximum resident set size: 7116 pages
% 4.33/2.08
%------------------------------------------------------------------------------