TSTP Solution File: SEU275+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU275+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:25:36 EDT 2023
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 27 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 24 ( 4 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',d4_wellord1) ).
fof(t6_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> well_founded_relation(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t6_wellord2) ).
fof(t5_wellord2,axiom,
! [X1] : antisymmetric(inclusion_relation(X1)),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t5_wellord2) ).
fof(t3_wellord2,axiom,
! [X1] : transitive(inclusion_relation(X1)),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t3_wellord2) ).
fof(t2_wellord2,axiom,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t2_wellord2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',dt_k1_wellord2) ).
fof(t4_wellord2,axiom,
! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t4_wellord2) ).
fof(t7_wellord2,conjecture,
! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p',t7_wellord2) ).
fof(c_0_8,plain,
! [X3] :
( ( reflexive(X3)
| ~ well_ordering(X3)
| ~ relation(X3) )
& ( transitive(X3)
| ~ well_ordering(X3)
| ~ relation(X3) )
& ( antisymmetric(X3)
| ~ well_ordering(X3)
| ~ relation(X3) )
& ( connected(X3)
| ~ well_ordering(X3)
| ~ relation(X3) )
& ( well_founded_relation(X3)
| ~ well_ordering(X3)
| ~ relation(X3) )
& ( ~ reflexive(X3)
| ~ transitive(X3)
| ~ antisymmetric(X3)
| ~ connected(X3)
| ~ well_founded_relation(X3)
| well_ordering(X3)
| ~ relation(X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])]) ).
fof(c_0_9,plain,
! [X4] :
( ~ ordinal(X4)
| well_founded_relation(inclusion_relation(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_wellord2])]) ).
fof(c_0_10,plain,
! [X6] : antisymmetric(inclusion_relation(X6)),
inference(variable_rename,[status(thm)],[t5_wellord2]) ).
fof(c_0_11,plain,
! [X7] : transitive(inclusion_relation(X7)),
inference(variable_rename,[status(thm)],[t3_wellord2]) ).
fof(c_0_12,plain,
! [X8] : reflexive(inclusion_relation(X8)),
inference(variable_rename,[status(thm)],[t2_wellord2]) ).
fof(c_0_13,plain,
! [X9] : relation(inclusion_relation(X9)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_14,plain,
! [X5] :
( ~ ordinal(X5)
| connected(inclusion_relation(X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_wellord2])]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
inference(assume_negation,[status(cth)],[t7_wellord2]) ).
cnf(c_0_16,plain,
( well_ordering(X1)
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( well_founded_relation(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
antisymmetric(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
transitive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
reflexive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
( connected(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,negated_conjecture,
( ordinal(esk1_0)
& ~ well_ordering(inclusion_relation(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_24,plain,
( well_ordering(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ well_ordering(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU275+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 08:08:50 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.IdLKck09jv/E---3.1_15123.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 15202 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNM-FFSF11-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 15205 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNM-FFSF11-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 11
% 0.15/0.41 # Removed by relevancy pruning/SinE : 3
% 0.15/0.41 # Initial clauses : 14
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 14
% 0.15/0.41 # Processed clauses : 29
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 0
% 0.15/0.41 # ...remaining for further processing : 29
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 3
% 0.15/0.41 # ...of the previous two non-redundant : 1
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 1
% 0.15/0.41 # Paramodulations : 3
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 4
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 15
% 0.15/0.41 # Positive orientable unit clauses : 5
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 9
% 0.15/0.41 # Current number of unprocessed clauses: 0
% 0.15/0.41 # ...number of literals in the above : 0
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 14
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 1
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 1
% 0.15/0.41 # Non-unit clause-clause subsumptions : 1
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 0
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 798
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.002 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.004 s
% 0.15/0.41 # Maximum resident set size: 1756 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.003 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.007 s
% 0.15/0.41 # Maximum resident set size: 1676 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------