TSTP Solution File: SEU243+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU243+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:31:01 EDT 2024
% Result : Theorem 1.07s 0.80s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 4 unt; 0 def)
% Number of atoms : 137 ( 16 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 184 ( 76 ~; 74 |; 22 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_well_founded_in(X1,X2)
<=> ! [X3] :
~ ( subset(X3,X2)
& X3 != empty_set
& ! [X4] :
~ ( in(X4,X3)
& disjoint(fiber(X1,X4),X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.59DuxrsWfD/E---3.1_21059.p',d3_wellord1) ).
fof(d2_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> ! [X2] :
~ ( subset(X2,relation_field(X1))
& X2 != empty_set
& ! [X3] :
~ ( in(X3,X2)
& disjoint(fiber(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.59DuxrsWfD/E---3.1_21059.p',d2_wellord1) ).
fof(t5_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.59DuxrsWfD/E---3.1_21059.p',t5_wellord1) ).
fof(c_0_3,plain,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_well_founded_in(X1,X2)
<=> ! [X3] :
~ ( subset(X3,X2)
& X3 != empty_set
& ! [X4] :
~ ( in(X4,X3)
& disjoint(fiber(X1,X4),X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_wellord1]) ).
fof(c_0_4,plain,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> ! [X2] :
~ ( subset(X2,relation_field(X1))
& X2 != empty_set
& ! [X3] :
~ ( in(X3,X2)
& disjoint(fiber(X1,X3),X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[d2_wellord1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X12,X14] :
( ( in(esk2_3(X8,X9,X10),X10)
| ~ subset(X10,X9)
| X10 = empty_set
| ~ is_well_founded_in(X8,X9)
| ~ relation(X8) )
& ( disjoint(fiber(X8,esk2_3(X8,X9,X10)),X10)
| ~ subset(X10,X9)
| X10 = empty_set
| ~ is_well_founded_in(X8,X9)
| ~ relation(X8) )
& ( subset(esk3_2(X8,X12),X12)
| is_well_founded_in(X8,X12)
| ~ relation(X8) )
& ( esk3_2(X8,X12) != empty_set
| is_well_founded_in(X8,X12)
| ~ relation(X8) )
& ( ~ in(X14,esk3_2(X8,X12))
| ~ disjoint(fiber(X8,X14),esk3_2(X8,X12))
| is_well_founded_in(X8,X12)
| ~ relation(X8) ) ),
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_3])])])])])])]) ).
fof(c_0_6,plain,
! [X19,X20,X23] :
( ( in(esk4_2(X19,X20),X20)
| ~ subset(X20,relation_field(X19))
| X20 = empty_set
| ~ well_founded_relation(X19)
| ~ relation(X19) )
& ( disjoint(fiber(X19,esk4_2(X19,X20)),X20)
| ~ subset(X20,relation_field(X19))
| X20 = empty_set
| ~ well_founded_relation(X19)
| ~ relation(X19) )
& ( subset(esk5_1(X19),relation_field(X19))
| well_founded_relation(X19)
| ~ relation(X19) )
& ( esk5_1(X19) != empty_set
| well_founded_relation(X19)
| ~ relation(X19) )
& ( ~ in(X23,esk5_1(X19))
| ~ disjoint(fiber(X19,X23),esk5_1(X19))
| well_founded_relation(X19)
| ~ relation(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(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
inference(assume_negation,[status(cth)],[t5_wellord1]) ).
cnf(c_0_8,plain,
( is_well_founded_in(X2,X3)
| ~ in(X1,esk3_2(X2,X3))
| ~ disjoint(fiber(X2,X1),esk3_2(X2,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( disjoint(fiber(X1,esk4_2(X1,X2)),X2)
| X2 = empty_set
| ~ subset(X2,relation_field(X1))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(esk4_2(X1,X2),X2)
| X2 = empty_set
| ~ subset(X2,relation_field(X1))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( is_well_founded_in(X1,X2)
| esk3_2(X1,X2) != empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,negated_conjecture,
( relation(esk1_0)
& ( ~ well_founded_relation(esk1_0)
| ~ is_well_founded_in(esk1_0,relation_field(esk1_0)) )
& ( well_founded_relation(esk1_0)
| is_well_founded_in(esk1_0,relation_field(esk1_0)) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,plain,
( is_well_founded_in(X1,X2)
| ~ well_founded_relation(X1)
| ~ subset(esk3_2(X1,X2),relation_field(X1))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
( subset(esk3_2(X1,X2),X2)
| is_well_founded_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( well_founded_relation(X2)
| ~ in(X1,esk5_1(X2))
| ~ disjoint(fiber(X2,X1),esk5_1(X2))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( disjoint(fiber(X1,esk2_3(X1,X2,X3)),X3)
| X3 = empty_set
| ~ subset(X3,X2)
| ~ is_well_founded_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( in(esk2_3(X1,X2,X3),X3)
| X3 = empty_set
| ~ subset(X3,X2)
| ~ is_well_founded_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( well_founded_relation(X1)
| esk5_1(X1) != empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( ~ well_founded_relation(esk1_0)
| ~ is_well_founded_in(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( is_well_founded_in(X1,relation_field(X1))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( well_founded_relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(esk5_1(X1),X2)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( subset(esk5_1(X1),relation_field(X1))
| well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
( well_founded_relation(esk1_0)
| is_well_founded_in(esk1_0,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
~ well_founded_relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( well_founded_relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
is_well_founded_in(esk1_0,relation_field(esk1_0)),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_21])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU243+2 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 08:42:30 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.59DuxrsWfD/E---3.1_21059.p
% 1.07/0.80 # Version: 3.1.0
% 1.07/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.07/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.07/0.80 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.80 # Starting new_bool_1 with 300s (1) cores
% 1.07/0.80 # Starting sh5l with 300s (1) cores
% 1.07/0.80 # new_bool_3 with pid 21179 completed with status 0
% 1.07/0.80 # Result found by new_bool_3
% 1.07/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.07/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.07/0.80 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.80 # Search class: FGHSM-FSLM31-SFFFFFNN
% 1.07/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.80 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 1.07/0.80 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 21189 completed with status 0
% 1.07/0.80 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.07/0.80 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.07/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.07/0.80 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.80 # Search class: FGHSM-FSLM31-SFFFFFNN
% 1.07/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.80 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 163s (1) cores
% 1.07/0.80 # Preprocessing time : 0.005 s
% 1.07/0.80
% 1.07/0.80 # Proof found!
% 1.07/0.80 # SZS status Theorem
% 1.07/0.80 # SZS output start CNFRefutation
% See solution above
% 1.07/0.80 # Parsed axioms : 296
% 1.07/0.80 # Removed by relevancy pruning/SinE : 191
% 1.07/0.80 # Initial clauses : 189
% 1.07/0.80 # Removed in clause preprocessing : 2
% 1.07/0.80 # Initial clauses in saturation : 187
% 1.07/0.80 # Processed clauses : 1814
% 1.07/0.80 # ...of these trivial : 46
% 1.07/0.80 # ...subsumed : 990
% 1.07/0.80 # ...remaining for further processing : 778
% 1.07/0.80 # Other redundant clauses eliminated : 58
% 1.07/0.80 # Clauses deleted for lack of memory : 0
% 1.07/0.80 # Backward-subsumed : 20
% 1.07/0.80 # Backward-rewritten : 14
% 1.07/0.80 # Generated clauses : 13785
% 1.07/0.80 # ...of the previous two non-redundant : 12454
% 1.07/0.80 # ...aggressively subsumed : 0
% 1.07/0.80 # Contextual simplify-reflections : 39
% 1.07/0.80 # Paramodulations : 13670
% 1.07/0.80 # Factorizations : 16
% 1.07/0.80 # NegExts : 0
% 1.07/0.80 # Equation resolutions : 98
% 1.07/0.80 # Disequality decompositions : 0
% 1.07/0.80 # Total rewrite steps : 2441
% 1.07/0.80 # ...of those cached : 2145
% 1.07/0.80 # Propositional unsat checks : 0
% 1.07/0.80 # Propositional check models : 0
% 1.07/0.80 # Propositional check unsatisfiable : 0
% 1.07/0.80 # Propositional clauses : 0
% 1.07/0.80 # Propositional clauses after purity: 0
% 1.07/0.80 # Propositional unsat core size : 0
% 1.07/0.80 # Propositional preprocessing time : 0.000
% 1.07/0.80 # Propositional encoding time : 0.000
% 1.07/0.80 # Propositional solver time : 0.000
% 1.07/0.80 # Success case prop preproc time : 0.000
% 1.07/0.80 # Success case prop encoding time : 0.000
% 1.07/0.80 # Success case prop solver time : 0.000
% 1.07/0.80 # Current number of processed clauses : 740
% 1.07/0.80 # Positive orientable unit clauses : 65
% 1.07/0.80 # Positive unorientable unit clauses: 2
% 1.07/0.80 # Negative unit clauses : 38
% 1.07/0.80 # Non-unit-clauses : 635
% 1.07/0.80 # Current number of unprocessed clauses: 10753
% 1.07/0.80 # ...number of literals in the above : 42714
% 1.07/0.80 # Current number of archived formulas : 0
% 1.07/0.80 # Current number of archived clauses : 35
% 1.07/0.80 # Clause-clause subsumption calls (NU) : 70101
% 1.07/0.80 # Rec. Clause-clause subsumption calls : 32510
% 1.07/0.80 # Non-unit clause-clause subsumptions : 691
% 1.07/0.80 # Unit Clause-clause subsumption calls : 1984
% 1.07/0.80 # Rewrite failures with RHS unbound : 0
% 1.07/0.80 # BW rewrite match attempts : 52
% 1.07/0.80 # BW rewrite match successes : 24
% 1.07/0.80 # Condensation attempts : 0
% 1.07/0.80 # Condensation successes : 0
% 1.07/0.80 # Termbank termtop insertions : 163912
% 1.07/0.80 # Search garbage collected termcells : 4243
% 1.07/0.80
% 1.07/0.80 # -------------------------------------------------
% 1.07/0.80 # User time : 0.266 s
% 1.07/0.80 # System time : 0.015 s
% 1.07/0.80 # Total time : 0.281 s
% 1.07/0.80 # Maximum resident set size: 2524 pages
% 1.07/0.80
% 1.07/0.80 # -------------------------------------------------
% 1.07/0.80 # User time : 0.274 s
% 1.07/0.80 # System time : 0.017 s
% 1.07/0.80 # Total time : 0.291 s
% 1.07/0.80 # Maximum resident set size: 2012 pages
% 1.07/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------