TSTP Solution File: NUM404+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM404+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 300s
% DateTime : Sat May 4 09:05:54 EDT 2024
% Result : Theorem 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 5 unt; 0 def)
% Number of atoms : 146 ( 9 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 162 ( 63 ~; 59 |; 23 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_ordinal1,conjecture,
! [X1] :
~ ! [X2] :
( in(X2,X1)
<=> ordinal(X2) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',t37_ordinal1) ).
fof(t23_ordinal1,axiom,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',t23_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',d3_tarski) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',d3_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',t24_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',d2_ordinal1) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',cc2_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p',antisymmetry_r2_hidden) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
~ ! [X2] :
( in(X2,X1)
<=> ordinal(X2) ),
inference(assume_negation,[status(cth)],[t37_ordinal1]) ).
fof(c_0_9,plain,
! [X47,X48] :
( ~ ordinal(X48)
| ~ in(X47,X48)
| ordinal(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_ordinal1])])]) ).
fof(c_0_10,plain,
! [X22,X23,X24,X25,X26] :
( ( ~ subset(X22,X23)
| ~ in(X24,X22)
| in(X24,X23) )
& ( in(esk4_2(X25,X26),X25)
| subset(X25,X26) )
& ( ~ in(esk4_2(X25,X26),X26)
| subset(X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X54] :
( ( ~ in(X54,esk19_0)
| ordinal(X54) )
& ( ~ ordinal(X54)
| in(X54,esk19_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,plain,
( ordinal(X2)
| ~ ordinal(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[d3_ordinal1]) ).
fof(c_0_15,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
cnf(c_0_16,negated_conjecture,
( in(X1,esk19_0)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ordinal(esk4_2(X1,X2))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X12,X13,X14] :
( ( ~ epsilon_transitive(X12)
| ~ in(X13,X12)
| subset(X13,X12) )
& ( in(esk1_1(X14),X14)
| epsilon_transitive(X14) )
& ( ~ subset(esk1_1(X14),X14)
| epsilon_transitive(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_ordinal1])])])])])])]) ).
fof(c_0_19,plain,
! [X16,X17,X18,X19] :
( ( ~ epsilon_connected(X16)
| ~ in(X17,X16)
| ~ in(X18,X16)
| in(X17,X18)
| X17 = X18
| in(X18,X17) )
& ( in(esk2_1(X19),X19)
| epsilon_connected(X19) )
& ( in(esk3_1(X19),X19)
| epsilon_connected(X19) )
& ( ~ in(esk2_1(X19),esk3_1(X19))
| epsilon_connected(X19) )
& ( esk2_1(X19) != esk3_1(X19)
| epsilon_connected(X19) )
& ( ~ in(esk3_1(X19),esk2_1(X19))
| epsilon_connected(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])])]) ).
fof(c_0_20,plain,
! [X49,X50] :
( ~ ordinal(X49)
| ~ ordinal(X50)
| in(X49,X50)
| X49 = X50
| in(X50,X49) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( subset(X1,X2)
| in(esk4_2(X1,X2),esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( in(esk1_1(X1),X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( epsilon_connected(X1)
| ~ in(esk3_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( epsilon_connected(X1)
| ~ in(esk2_1(X1),esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
( epsilon_connected(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( in(esk2_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
( in(esk3_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_31,plain,
! [X10] :
( ~ epsilon_transitive(X10)
| ~ epsilon_connected(X10)
| ordinal(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])])]) ).
cnf(c_0_32,plain,
( epsilon_transitive(X1)
| ~ subset(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( subset(X1,esk19_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( epsilon_transitive(esk19_0)
| ordinal(esk1_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,plain,
( epsilon_connected(X1)
| ~ ordinal(esk2_1(X1))
| ~ ordinal(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( epsilon_connected(esk19_0)
| ordinal(esk2_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( epsilon_connected(esk19_0)
| ordinal(esk3_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
fof(c_0_38,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_39,plain,
( ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
epsilon_transitive(esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
epsilon_connected(esk19_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
fof(c_0_42,plain,
! [X4,X5] :
( ~ in(X4,X5)
| ~ in(X5,X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
cnf(c_0_43,negated_conjecture,
ordinal(esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_44,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
in(esk19_0,esk19_0),
inference(spm,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM404+1 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n026.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 09:42:36 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.g8AZlUMaAK/E---3.1_2101.p
% 0.16/0.49 # Version: 3.1.0
% 0.16/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2179 completed with status 0
% 0.16/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.16/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.49 # Starting sh5l with 136s (1) cores
% 0.16/0.49 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2185 completed with status 0
% 0.16/0.49 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.16/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 # No SInE strategy applied
% 0.16/0.49 # Search class: FGHSS-FFMM21-SFFFFFNN
% 0.16/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.49 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 811s (1) cores
% 0.16/0.49 # Preprocessing time : 0.001 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Theorem
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 41
% 0.16/0.49 # Removed by relevancy pruning/SinE : 0
% 0.16/0.49 # Initial clauses : 92
% 0.16/0.49 # Removed in clause preprocessing : 2
% 0.16/0.49 # Initial clauses in saturation : 90
% 0.16/0.49 # Processed clauses : 1127
% 0.16/0.49 # ...of these trivial : 6
% 0.16/0.49 # ...subsumed : 630
% 0.16/0.49 # ...remaining for further processing : 491
% 0.16/0.49 # Other redundant clauses eliminated : 2
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 20
% 0.16/0.49 # Backward-rewritten : 45
% 0.16/0.49 # Generated clauses : 2997
% 0.16/0.49 # ...of the previous two non-redundant : 2695
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 15
% 0.16/0.49 # Paramodulations : 2983
% 0.16/0.49 # Factorizations : 12
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 2
% 0.16/0.49 # Disequality decompositions : 0
% 0.16/0.49 # Total rewrite steps : 454
% 0.16/0.49 # ...of those cached : 417
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 345
% 0.16/0.49 # Positive orientable unit clauses : 48
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 8
% 0.16/0.49 # Non-unit-clauses : 289
% 0.16/0.49 # Current number of unprocessed clauses: 1710
% 0.16/0.49 # ...number of literals in the above : 8705
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 146
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 16821
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 8391
% 0.16/0.49 # Non-unit clause-clause subsumptions : 573
% 0.16/0.49 # Unit Clause-clause subsumption calls : 279
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 10
% 0.16/0.49 # BW rewrite match successes : 7
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 41144
% 0.16/0.49 # Search garbage collected termcells : 689
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.061 s
% 0.16/0.49 # System time : 0.008 s
% 0.16/0.49 # Total time : 0.069 s
% 0.16/0.49 # Maximum resident set size: 1896 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.319 s
% 0.16/0.49 # System time : 0.013 s
% 0.16/0.49 # Total time : 0.332 s
% 0.16/0.49 # Maximum resident set size: 1720 pages
% 0.16/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------