TSTP Solution File: SEU241+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU241+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:27 EDT 2023
% Result : Theorem 478.03s 61.69s
% Output : CNFRefutation 478.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 127 ( 14 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 150 ( 56 ~; 64 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 3 sgn; 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X2),X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wDQoBiv9Tt/E---3.1_4676.p',l3_wellord1) ).
fof(d4_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_antisymmetric_in(X1,X2)
<=> ! [X3,X4] :
( ( in(X3,X2)
& in(X4,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X3),X1) )
=> X3 = X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wDQoBiv9Tt/E---3.1_4676.p',d4_relat_2) ).
fof(d12_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> is_antisymmetric_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.wDQoBiv9Tt/E---3.1_4676.p',d12_relat_2) ).
fof(t30_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_field(X3))
& in(X2,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.wDQoBiv9Tt/E---3.1_4676.p',t30_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X2),X1) )
=> X2 = X3 ) ) ),
inference(assume_negation,[status(cth)],[l3_wellord1]) ).
fof(c_0_5,negated_conjecture,
! [X10,X11] :
( relation(esk1_0)
& ( in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ antisymmetric(esk1_0) )
& ( in(ordered_pair(esk3_0,esk2_0),esk1_0)
| ~ antisymmetric(esk1_0) )
& ( esk2_0 != esk3_0
| ~ antisymmetric(esk1_0) )
& ( antisymmetric(esk1_0)
| ~ in(ordered_pair(X10,X11),esk1_0)
| ~ in(ordered_pair(X11,X10),esk1_0)
| X10 = X11 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_6,plain,
! [X129,X130,X131,X132,X133] :
( ( ~ is_antisymmetric_in(X129,X130)
| ~ in(X131,X130)
| ~ in(X132,X130)
| ~ in(ordered_pair(X131,X132),X129)
| ~ in(ordered_pair(X132,X131),X129)
| X131 = X132
| ~ relation(X129) )
& ( in(esk30_2(X129,X133),X133)
| is_antisymmetric_in(X129,X133)
| ~ relation(X129) )
& ( in(esk31_2(X129,X133),X133)
| is_antisymmetric_in(X129,X133)
| ~ relation(X129) )
& ( in(ordered_pair(esk30_2(X129,X133),esk31_2(X129,X133)),X129)
| is_antisymmetric_in(X129,X133)
| ~ relation(X129) )
& ( in(ordered_pair(esk31_2(X129,X133),esk30_2(X129,X133)),X129)
| is_antisymmetric_in(X129,X133)
| ~ relation(X129) )
& ( esk30_2(X129,X133) != esk31_2(X129,X133)
| is_antisymmetric_in(X129,X133)
| ~ relation(X129) ) ),
inference(distribute,[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)],[d4_relat_2])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( antisymmetric(esk1_0)
| X1 = X2
| ~ in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X2,X1),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(ordered_pair(esk30_2(X1,X2),esk31_2(X1,X2)),X1)
| is_antisymmetric_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( esk31_2(esk1_0,X1) = esk30_2(esk1_0,X1)
| is_antisymmetric_in(esk1_0,X1)
| antisymmetric(esk1_0)
| ~ in(ordered_pair(esk31_2(esk1_0,X1),esk30_2(esk1_0,X1)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,plain,
( in(ordered_pair(esk31_2(X1,X2),esk30_2(X1,X2)),X1)
| is_antisymmetric_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X78] :
( ( ~ antisymmetric(X78)
| is_antisymmetric_in(X78,relation_field(X78))
| ~ relation(X78) )
& ( ~ is_antisymmetric_in(X78,relation_field(X78))
| antisymmetric(X78)
| ~ relation(X78) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d12_relat_2])])]) ).
cnf(c_0_13,plain,
( is_antisymmetric_in(X1,X2)
| esk30_2(X1,X2) != esk31_2(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( esk31_2(esk1_0,X1) = esk30_2(esk1_0,X1)
| is_antisymmetric_in(esk1_0,X1)
| antisymmetric(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]) ).
cnf(c_0_15,plain,
( antisymmetric(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( is_antisymmetric_in(esk1_0,X1)
| antisymmetric(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]) ).
cnf(c_0_17,negated_conjecture,
( in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ antisymmetric(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
antisymmetric(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9])]) ).
cnf(c_0_19,negated_conjecture,
( in(ordered_pair(esk3_0,esk2_0),esk1_0)
| ~ antisymmetric(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( esk2_0 != esk3_0
| ~ antisymmetric(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_21,lemma,
! [X137,X138,X139] :
( ( in(X137,relation_field(X139))
| ~ in(ordered_pair(X137,X138),X139)
| ~ relation(X139) )
& ( in(X138,relation_field(X139))
| ~ in(ordered_pair(X137,X138),X139)
| ~ relation(X139) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_relat_1])])]) ).
cnf(c_0_22,plain,
( X3 = X4
| ~ is_antisymmetric_in(X1,X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X4,X3),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
in(ordered_pair(esk2_0,esk3_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
in(ordered_pair(esk3_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
esk3_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_18])]) ).
cnf(c_0_26,lemma,
( in(X1,relation_field(X2))
| ~ in(ordered_pair(X3,X1),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,lemma,
( in(X1,relation_field(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_antisymmetric_in(esk1_0,X1)
| ~ in(esk2_0,X1)
| ~ in(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( is_antisymmetric_in(X1,relation_field(X1))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,lemma,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_9])]) ).
cnf(c_0_31,lemma,
in(esk3_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_9])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18]),c_0_9])]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : SEU241+2 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n002.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 08:55:59 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.wDQoBiv9Tt/E---3.1_4676.p
% 478.03/61.69 # Version: 3.1pre001
% 478.03/61.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 478.03/61.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 478.03/61.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 478.03/61.69 # Starting new_bool_3 with 300s (1) cores
% 478.03/61.69 # Starting new_bool_1 with 300s (1) cores
% 478.03/61.69 # Starting sh5l with 300s (1) cores
% 478.03/61.69 # new_bool_3 with pid 4805 completed with status 0
% 478.03/61.69 # Result found by new_bool_3
% 478.03/61.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 478.03/61.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 478.03/61.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 478.03/61.69 # Starting new_bool_3 with 300s (1) cores
% 478.03/61.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 478.03/61.69 # Search class: FGHSM-FFMM31-SFFFFFNN
% 478.03/61.69 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 478.03/61.69 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 478.03/61.69 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4808 completed with status 7
% 478.03/61.69 # Starting new_bool_3 with 31s (1) cores
% 478.03/61.69 # new_bool_3 with pid 4918 completed with status 7
% 478.03/61.69 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 28s (1) cores
% 478.03/61.69 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 4927 completed with status 0
% 478.03/61.69 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 478.03/61.69 # Preprocessing class: FSLSSMSSSSSNFFN.
% 478.03/61.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 478.03/61.69 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 478.03/61.69 # Starting new_bool_3 with 300s (1) cores
% 478.03/61.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 478.03/61.69 # Search class: FGHSM-FFMM31-SFFFFFNN
% 478.03/61.69 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 478.03/61.69 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 478.03/61.69 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4808 completed with status 7
% 478.03/61.69 # Starting new_bool_3 with 31s (1) cores
% 478.03/61.69 # new_bool_3 with pid 4918 completed with status 7
% 478.03/61.69 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 28s (1) cores
% 478.03/61.69 # Preprocessing time : 0.003 s
% 478.03/61.69
% 478.03/61.69 # Proof found!
% 478.03/61.69 # SZS status Theorem
% 478.03/61.69 # SZS output start CNFRefutation
% See solution above
% 478.03/61.69 # Parsed axioms : 289
% 478.03/61.69 # Removed by relevancy pruning/SinE : 215
% 478.03/61.69 # Initial clauses : 134
% 478.03/61.69 # Removed in clause preprocessing : 2
% 478.03/61.69 # Initial clauses in saturation : 132
% 478.03/61.69 # Processed clauses : 1376
% 478.03/61.69 # ...of these trivial : 27
% 478.03/61.69 # ...subsumed : 723
% 478.03/61.69 # ...remaining for further processing : 625
% 478.03/61.69 # Other redundant clauses eliminated : 39
% 478.03/61.69 # Clauses deleted for lack of memory : 0
% 478.03/61.69 # Backward-subsumed : 10
% 478.03/61.69 # Backward-rewritten : 23
% 478.03/61.69 # Generated clauses : 8540
% 478.03/61.69 # ...of the previous two non-redundant : 7953
% 478.03/61.69 # ...aggressively subsumed : 0
% 478.03/61.69 # Contextual simplify-reflections : 23
% 478.03/61.69 # Paramodulations : 8454
% 478.03/61.69 # Factorizations : 12
% 478.03/61.69 # NegExts : 0
% 478.03/61.69 # Equation resolutions : 74
% 478.03/61.69 # Total rewrite steps : 1104
% 478.03/61.69 # Propositional unsat checks : 0
% 478.03/61.69 # Propositional check models : 0
% 478.03/61.69 # Propositional check unsatisfiable : 0
% 478.03/61.69 # Propositional clauses : 0
% 478.03/61.69 # Propositional clauses after purity: 0
% 478.03/61.69 # Propositional unsat core size : 0
% 478.03/61.69 # Propositional preprocessing time : 0.000
% 478.03/61.69 # Propositional encoding time : 0.000
% 478.03/61.69 # Propositional solver time : 0.000
% 478.03/61.69 # Success case prop preproc time : 0.000
% 478.03/61.69 # Success case prop encoding time : 0.000
% 478.03/61.69 # Success case prop solver time : 0.000
% 478.03/61.69 # Current number of processed clauses : 590
% 478.03/61.69 # Positive orientable unit clauses : 56
% 478.03/61.69 # Positive unorientable unit clauses: 2
% 478.03/61.69 # Negative unit clauses : 52
% 478.03/61.69 # Non-unit-clauses : 480
% 478.03/61.69 # Current number of unprocessed clauses: 6685
% 478.03/61.69 # ...number of literals in the above : 30187
% 478.03/61.69 # Current number of archived formulas : 0
% 478.03/61.69 # Current number of archived clauses : 33
% 478.03/61.69 # Clause-clause subsumption calls (NU) : 30341
% 478.03/61.69 # Rec. Clause-clause subsumption calls : 11412
% 478.03/61.69 # Non-unit clause-clause subsumptions : 386
% 478.03/61.69 # Unit Clause-clause subsumption calls : 3126
% 478.03/61.69 # Rewrite failures with RHS unbound : 0
% 478.03/61.69 # BW rewrite match attempts : 37
% 478.03/61.69 # BW rewrite match successes : 17
% 478.03/61.69 # Condensation attempts : 0
% 478.03/61.69 # Condensation successes : 0
% 478.03/61.69 # Termbank termtop insertions : 111965
% 478.03/61.69
% 478.03/61.69 # -------------------------------------------------
% 478.03/61.69 # User time : 58.575 s
% 478.03/61.69 # System time : 0.719 s
% 478.03/61.69 # Total time : 59.294 s
% 478.03/61.69 # Maximum resident set size: 2500 pages
% 478.03/61.69
% 478.03/61.69 # -------------------------------------------------
% 478.03/61.69 # User time : 58.584 s
% 478.03/61.69 # System time : 0.722 s
% 478.03/61.69 # Total time : 59.306 s
% 478.03/61.69 # Maximum resident set size: 1984 pages
% 478.03/61.69 % E---3.1 exiting
% 478.03/61.69 % E---3.1 exiting
%------------------------------------------------------------------------------