TSTP Solution File: SEU257+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU257+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 09:25:54 EDT 2024
% Result : Theorem 0.41s 0.87s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 16 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 139 ( 57 ~; 54 |; 11 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 13 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t32_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t32_wellord1) ).
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.uc7F2KthCG/E---3.1_23882.p',d4_wellord1) ).
fof(t22_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t22_wellord1) ).
fof(t31_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( well_founded_relation(X2)
=> well_founded_relation(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t31_wellord1) ).
fof(t24_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t24_wellord1) ).
fof(t23_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t23_wellord1) ).
fof(t25_wellord1,lemma,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',t25_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.uc7F2KthCG/E---3.1_23882.p',dt_k2_wellord1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t32_wellord1]) ).
fof(c_0_9,plain,
! [X285] :
( ( reflexive(X285)
| ~ well_ordering(X285)
| ~ relation(X285) )
& ( transitive(X285)
| ~ well_ordering(X285)
| ~ relation(X285) )
& ( antisymmetric(X285)
| ~ well_ordering(X285)
| ~ relation(X285) )
& ( connected(X285)
| ~ well_ordering(X285)
| ~ relation(X285) )
& ( well_founded_relation(X285)
| ~ well_ordering(X285)
| ~ relation(X285) )
& ( ~ reflexive(X285)
| ~ transitive(X285)
| ~ antisymmetric(X285)
| ~ connected(X285)
| ~ well_founded_relation(X285)
| well_ordering(X285)
| ~ relation(X285) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])])]) ).
fof(c_0_10,negated_conjecture,
( relation(esk109_0)
& well_ordering(esk109_0)
& ~ well_ordering(relation_restriction(esk109_0,esk108_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,lemma,
! [X640,X641] :
( ~ relation(X641)
| ~ reflexive(X641)
| reflexive(relation_restriction(X641,X640)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t22_wellord1])])]) ).
cnf(c_0_12,plain,
( reflexive(X1)
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
well_ordering(esk109_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk109_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,lemma,
! [X674,X675] :
( ~ relation(X675)
| ~ well_founded_relation(X675)
| well_founded_relation(relation_restriction(X675,X674)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t31_wellord1])])]) ).
cnf(c_0_16,plain,
( well_founded_relation(X1)
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,lemma,
! [X651,X652] :
( ~ relation(X652)
| ~ transitive(X652)
| transitive(relation_restriction(X652,X651)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_wellord1])])]) ).
cnf(c_0_18,plain,
( transitive(X1)
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,lemma,
! [X647,X648] :
( ~ relation(X648)
| ~ connected(X648)
| connected(relation_restriction(X648,X647)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_wellord1])])]) ).
cnf(c_0_20,plain,
( connected(X1)
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_21,lemma,
! [X655,X656] :
( ~ relation(X656)
| ~ antisymmetric(X656)
| antisymmetric(relation_restriction(X656,X655)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t25_wellord1])])]) ).
cnf(c_0_22,plain,
( antisymmetric(X1)
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_23,plain,
! [X380,X381] :
( ~ relation(X380)
| relation(relation_restriction(X380,X381)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
cnf(c_0_24,lemma,
( reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
reflexive(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_26,lemma,
( well_founded_relation(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
well_founded_relation(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14])]) ).
cnf(c_0_28,lemma,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
transitive(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_14])]) ).
cnf(c_0_30,lemma,
( connected(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,negated_conjecture,
connected(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14])]) ).
cnf(c_0_32,lemma,
( antisymmetric(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,negated_conjecture,
antisymmetric(esk109_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14])]) ).
cnf(c_0_34,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,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_9]) ).
cnf(c_0_36,lemma,
reflexive(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]) ).
cnf(c_0_37,lemma,
well_founded_relation(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14])]) ).
cnf(c_0_38,lemma,
transitive(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14])]) ).
cnf(c_0_39,lemma,
connected(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14])]) ).
cnf(c_0_40,lemma,
antisymmetric(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_14])]) ).
cnf(c_0_41,negated_conjecture,
relation(relation_restriction(esk109_0,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_42,negated_conjecture,
~ well_ordering(relation_restriction(esk109_0,esk108_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,lemma,
well_ordering(relation_restriction(esk109_0,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SEU257+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n028.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Fri May 3 08:13:48 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.23/0.56 Running first-order theorem proving
% 0.23/0.56 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.uc7F2KthCG/E---3.1_23882.p
% 0.41/0.87 # Version: 3.1.0
% 0.41/0.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.87 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.87 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.87 # Starting sh5l with 300s (1) cores
% 0.41/0.87 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 23981 completed with status 0
% 0.41/0.87 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.41/0.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.87 # No SInE strategy applied
% 0.41/0.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.41/0.87 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.41/0.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.41/0.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.41/0.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.41/0.87 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 0.41/0.87 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with pid 23992 completed with status 0
% 0.41/0.87 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i
% 0.41/0.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.87 # No SInE strategy applied
% 0.41/0.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.41/0.87 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.41/0.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.41/0.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.41/0.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.41/0.87 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 0.41/0.87 # Preprocessing time : 0.010 s
% 0.41/0.87 # Presaturation interreduction done
% 0.41/0.87
% 0.41/0.87 # Proof found!
% 0.41/0.87 # SZS status Theorem
% 0.41/0.87 # SZS output start CNFRefutation
% See solution above
% 0.41/0.87 # Parsed axioms : 316
% 0.41/0.87 # Removed by relevancy pruning/SinE : 0
% 0.41/0.87 # Initial clauses : 674
% 0.41/0.87 # Removed in clause preprocessing : 30
% 0.41/0.87 # Initial clauses in saturation : 644
% 0.41/0.87 # Processed clauses : 1368
% 0.41/0.87 # ...of these trivial : 15
% 0.41/0.87 # ...subsumed : 76
% 0.41/0.87 # ...remaining for further processing : 1277
% 0.41/0.87 # Other redundant clauses eliminated : 39
% 0.41/0.87 # Clauses deleted for lack of memory : 0
% 0.41/0.87 # Backward-subsumed : 0
% 0.41/0.87 # Backward-rewritten : 19
% 0.41/0.87 # Generated clauses : 8829
% 0.41/0.87 # ...of the previous two non-redundant : 8597
% 0.41/0.87 # ...aggressively subsumed : 0
% 0.41/0.87 # Contextual simplify-reflections : 10
% 0.41/0.87 # Paramodulations : 8725
% 0.41/0.87 # Factorizations : 14
% 0.41/0.87 # NegExts : 0
% 0.41/0.87 # Equation resolutions : 90
% 0.41/0.87 # Disequality decompositions : 0
% 0.41/0.87 # Total rewrite steps : 919
% 0.41/0.87 # ...of those cached : 759
% 0.41/0.87 # Propositional unsat checks : 0
% 0.41/0.87 # Propositional check models : 0
% 0.41/0.87 # Propositional check unsatisfiable : 0
% 0.41/0.87 # Propositional clauses : 0
% 0.41/0.87 # Propositional clauses after purity: 0
% 0.41/0.87 # Propositional unsat core size : 0
% 0.41/0.87 # Propositional preprocessing time : 0.000
% 0.41/0.87 # Propositional encoding time : 0.000
% 0.41/0.87 # Propositional solver time : 0.000
% 0.41/0.87 # Success case prop preproc time : 0.000
% 0.41/0.87 # Success case prop encoding time : 0.000
% 0.41/0.87 # Success case prop solver time : 0.000
% 0.41/0.87 # Current number of processed clauses : 651
% 0.41/0.87 # Positive orientable unit clauses : 102
% 0.41/0.87 # Positive unorientable unit clauses: 3
% 0.41/0.87 # Negative unit clauses : 20
% 0.41/0.87 # Non-unit-clauses : 526
% 0.41/0.87 # Current number of unprocessed clauses: 8411
% 0.41/0.87 # ...number of literals in the above : 30788
% 0.41/0.87 # Current number of archived formulas : 0
% 0.41/0.87 # Current number of archived clauses : 620
% 0.41/0.87 # Clause-clause subsumption calls (NU) : 163273
% 0.41/0.87 # Rec. Clause-clause subsumption calls : 45654
% 0.41/0.87 # Non-unit clause-clause subsumptions : 51
% 0.41/0.87 # Unit Clause-clause subsumption calls : 9378
% 0.41/0.87 # Rewrite failures with RHS unbound : 0
% 0.41/0.87 # BW rewrite match attempts : 63
% 0.41/0.87 # BW rewrite match successes : 51
% 0.41/0.87 # Condensation attempts : 0
% 0.41/0.87 # Condensation successes : 0
% 0.41/0.87 # Termbank termtop insertions : 193134
% 0.41/0.87 # Search garbage collected termcells : 11573
% 0.41/0.87
% 0.41/0.87 # -------------------------------------------------
% 0.41/0.87 # User time : 0.271 s
% 0.41/0.87 # System time : 0.014 s
% 0.41/0.87 # Total time : 0.285 s
% 0.41/0.87 # Maximum resident set size: 4048 pages
% 0.41/0.87
% 0.41/0.87 # -------------------------------------------------
% 0.41/0.87 # User time : 1.241 s
% 0.41/0.87 # System time : 0.058 s
% 0.41/0.87 # Total time : 1.299 s
% 0.41/0.87 # Maximum resident set size: 2036 pages
% 0.41/0.87 % E---3.1 exiting
% 0.41/0.87 % E exiting
%------------------------------------------------------------------------------