TSTP Solution File: NUM412+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM412+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 8.52s 2.30s
% Output : CNFRefutation 8.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 11 unt; 0 nHn; 26 RR)
% Number of literals : 55 ( 0 equ; 31 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( subset(relation_rng(X1),X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_14) ).
cnf(i_0_18,plain,
( function(X1)
| ~ transfinite_sequence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_18) ).
cnf(i_0_19,plain,
( relation(X1)
| ~ transfinite_sequence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_19) ).
cnf(i_0_17,plain,
( transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_17) ).
cnf(i_0_92,negated_conjecture,
transfinite_sequence_of(esk18_0,esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_92) ).
cnf(i_0_89,plain,
( transfinite_sequence_of(X1,X2)
| ~ transfinite_sequence_of(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_89) ).
cnf(i_0_15,plain,
( transfinite_sequence_of(tseq_dom_restriction(X1,X2),relation_rng(X1))
| ~ function(X1)
| ~ ordinal(X2)
| ~ relation(X1)
| ~ transfinite_sequence(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_15) ).
cnf(i_0_90,negated_conjecture,
~ transfinite_sequence_of(tseq_dom_restriction(esk18_0,esk19_0),esk17_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_90) ).
cnf(i_0_91,negated_conjecture,
ordinal(esk19_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_3fr8sj2/lgb.p',i_0_91) ).
cnf(c_0_102,plain,
( subset(relation_rng(X1),X2)
| ~ function(X1)
| ~ relation(X1)
| ~ transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
i_0_14 ).
cnf(c_0_103,plain,
( function(X1)
| ~ transfinite_sequence_of(X1,X2) ),
i_0_18 ).
cnf(c_0_104,plain,
( relation(X1)
| ~ transfinite_sequence_of(X1,X2) ),
i_0_19 ).
cnf(c_0_105,plain,
( transfinite_sequence(X1)
| ~ transfinite_sequence_of(X1,X2) ),
i_0_17 ).
cnf(c_0_106,plain,
( subset(relation_rng(X1),X2)
| ~ transfinite_sequence_of(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105]) ).
cnf(c_0_107,negated_conjecture,
transfinite_sequence_of(esk18_0,esk17_0),
i_0_92 ).
cnf(c_0_108,plain,
( transfinite_sequence_of(X1,X2)
| ~ transfinite_sequence_of(X1,X3)
| ~ subset(X3,X2) ),
i_0_89 ).
cnf(c_0_109,negated_conjecture,
subset(relation_rng(esk18_0),esk17_0),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,plain,
( transfinite_sequence_of(X1,esk17_0)
| ~ transfinite_sequence_of(X1,relation_rng(esk18_0)) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_111,plain,
( transfinite_sequence_of(tseq_dom_restriction(X1,X2),relation_rng(X1))
| ~ function(X1)
| ~ ordinal(X2)
| ~ relation(X1)
| ~ transfinite_sequence(X1) ),
i_0_15 ).
cnf(c_0_112,negated_conjecture,
transfinite_sequence(esk18_0),
inference(spm,[status(thm)],[c_0_105,c_0_107]) ).
cnf(c_0_113,negated_conjecture,
relation(esk18_0),
inference(spm,[status(thm)],[c_0_104,c_0_107]) ).
cnf(c_0_114,negated_conjecture,
function(esk18_0),
inference(spm,[status(thm)],[c_0_103,c_0_107]) ).
cnf(c_0_115,negated_conjecture,
~ transfinite_sequence_of(tseq_dom_restriction(esk18_0,esk19_0),esk17_0),
i_0_90 ).
cnf(c_0_116,plain,
( transfinite_sequence_of(tseq_dom_restriction(esk18_0,X1),esk17_0)
| ~ ordinal(X1) ),
inference(cn,[status(thm)],[inference(rw,[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_114])]) ).
cnf(c_0_117,negated_conjecture,
ordinal(esk19_0),
i_0_91 ).
cnf(c_0_118,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM412+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jul 6 19:17:54 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 8.52/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.52/2.30 # No SInE strategy applied
% 8.52/2.30 # Trying AutoSched0 for 150 seconds
% 8.52/2.30 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S2q
% 8.52/2.30 # and selection function SelectCQArNTNp.
% 8.52/2.30 #
% 8.52/2.30 # Preprocessing time : 0.018 s
% 8.52/2.30 # Presaturation interreduction done
% 8.52/2.30
% 8.52/2.30 # Proof found!
% 8.52/2.30 # SZS status Theorem
% 8.52/2.30 # SZS output start CNFRefutation
% See solution above
% 8.52/2.30 # Training examples: 0 positive, 0 negative
% 8.52/2.30
% 8.52/2.30 # -------------------------------------------------
% 8.52/2.30 # User time : 0.022 s
% 8.52/2.30 # System time : 0.003 s
% 8.52/2.30 # Total time : 0.025 s
% 8.52/2.30 # Maximum resident set size: 7124 pages
% 8.52/2.30
%------------------------------------------------------------------------------