TSTP Solution File: SEU204+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU204+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:14 EDT 2023
% Result : Theorem 29.84s 4.50s
% Output : CNFRefutation 29.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 68 ( 26 ~; 24 |; 10 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 36 ( 1 sgn; 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t144_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_image(X2,X1),relation_rng(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.GDbBV5TwVW/E---3.1_17423.p',t144_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.GDbBV5TwVW/E---3.1_17423.p',d3_tarski) ).
fof(t143_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_image(X3,X2))
<=> ? [X4] :
( in(X4,relation_dom(X3))
& in(ordered_pair(X4,X1),X3)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GDbBV5TwVW/E---3.1_17423.p',t143_relat_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GDbBV5TwVW/E---3.1_17423.p',t20_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_image(X2,X1),relation_rng(X2)) ),
inference(assume_negation,[status(cth)],[t144_relat_1]) ).
fof(c_0_5,negated_conjecture,
( relation(esk2_0)
& ~ subset(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X11,X12,X13,X14,X15] :
( ( ~ subset(X11,X12)
| ~ in(X13,X11)
| in(X13,X12) )
& ( in(esk3_2(X14,X15),X14)
| subset(X14,X15) )
& ( ~ in(esk3_2(X14,X15),X15)
| subset(X14,X15) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_7,lemma,
! [X52,X53,X54,X56] :
( ( in(esk10_3(X52,X53,X54),relation_dom(X54))
| ~ in(X52,relation_image(X54,X53))
| ~ relation(X54) )
& ( in(ordered_pair(esk10_3(X52,X53,X54),X52),X54)
| ~ in(X52,relation_image(X54,X53))
| ~ relation(X54) )
& ( in(esk10_3(X52,X53,X54),X53)
| ~ in(X52,relation_image(X54,X53))
| ~ relation(X54) )
& ( ~ in(X56,relation_dom(X54))
| ~ in(ordered_pair(X56,X52),X54)
| ~ in(X56,X53)
| in(X52,relation_image(X54,X53))
| ~ relation(X54) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t143_relat_1])])])])]) ).
cnf(c_0_8,negated_conjecture,
~ subset(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,lemma,
! [X33,X34,X35] :
( ( in(X33,relation_dom(X35))
| ~ in(ordered_pair(X33,X34),X35)
| ~ relation(X35) )
& ( in(X34,relation_rng(X35))
| ~ in(ordered_pair(X33,X34),X35)
| ~ relation(X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])]) ).
cnf(c_0_11,lemma,
( in(ordered_pair(esk10_3(X1,X2,X3),X1),X3)
| ~ in(X1,relation_image(X3,X2))
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
in(esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),relation_image(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,lemma,
( in(X1,relation_rng(X2))
| ~ in(ordered_pair(X3,X1),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
in(ordered_pair(esk10_3(esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),esk1_0,esk2_0),esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0))),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
~ in(esk3_2(relation_image(esk2_0,esk1_0),relation_rng(esk2_0)),relation_rng(esk2_0)),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_18,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SEU204+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n008.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 08:41:43 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.GDbBV5TwVW/E---3.1_17423.p
% 29.84/4.50 # Version: 3.1pre001
% 29.84/4.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.84/4.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.84/4.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.84/4.50 # Starting new_bool_3 with 300s (1) cores
% 29.84/4.50 # Starting new_bool_1 with 300s (1) cores
% 29.84/4.50 # Starting sh5l with 300s (1) cores
% 29.84/4.50 # new_bool_1 with pid 17503 completed with status 0
% 29.84/4.50 # Result found by new_bool_1
% 29.84/4.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.84/4.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.84/4.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.84/4.50 # Starting new_bool_3 with 300s (1) cores
% 29.84/4.50 # Starting new_bool_1 with 300s (1) cores
% 29.84/4.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.84/4.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 29.84/4.50 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 29.84/4.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 29.84/4.50 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17506 completed with status 0
% 29.84/4.50 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 29.84/4.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 29.84/4.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 29.84/4.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 29.84/4.50 # Starting new_bool_3 with 300s (1) cores
% 29.84/4.50 # Starting new_bool_1 with 300s (1) cores
% 29.84/4.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.84/4.50 # Search class: FGHSM-FFMM31-SFFFFFNN
% 29.84/4.50 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 29.84/4.50 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 29.84/4.50 # Preprocessing time : 0.003 s
% 29.84/4.50 # Presaturation interreduction done
% 29.84/4.50
% 29.84/4.50 # Proof found!
% 29.84/4.50 # SZS status Theorem
% 29.84/4.50 # SZS output start CNFRefutation
% See solution above
% 29.84/4.50 # Parsed axioms : 199
% 29.84/4.50 # Removed by relevancy pruning/SinE : 134
% 29.84/4.50 # Initial clauses : 124
% 29.84/4.50 # Removed in clause preprocessing : 2
% 29.84/4.50 # Initial clauses in saturation : 122
% 29.84/4.50 # Processed clauses : 12337
% 29.84/4.50 # ...of these trivial : 130
% 29.84/4.50 # ...subsumed : 9284
% 29.84/4.50 # ...remaining for further processing : 2923
% 29.84/4.50 # Other redundant clauses eliminated : 616
% 29.84/4.50 # Clauses deleted for lack of memory : 0
% 29.84/4.50 # Backward-subsumed : 212
% 29.84/4.50 # Backward-rewritten : 54
% 29.84/4.50 # Generated clauses : 217494
% 29.84/4.50 # ...of the previous two non-redundant : 204674
% 29.84/4.50 # ...aggressively subsumed : 0
% 29.84/4.50 # Contextual simplify-reflections : 58
% 29.84/4.50 # Paramodulations : 216830
% 29.84/4.50 # Factorizations : 47
% 29.84/4.50 # NegExts : 0
% 29.84/4.50 # Equation resolutions : 618
% 29.84/4.50 # Total rewrite steps : 46951
% 29.84/4.50 # Propositional unsat checks : 0
% 29.84/4.50 # Propositional check models : 0
% 29.84/4.50 # Propositional check unsatisfiable : 0
% 29.84/4.50 # Propositional clauses : 0
% 29.84/4.50 # Propositional clauses after purity: 0
% 29.84/4.50 # Propositional unsat core size : 0
% 29.84/4.50 # Propositional preprocessing time : 0.000
% 29.84/4.50 # Propositional encoding time : 0.000
% 29.84/4.50 # Propositional solver time : 0.000
% 29.84/4.50 # Success case prop preproc time : 0.000
% 29.84/4.50 # Success case prop encoding time : 0.000
% 29.84/4.50 # Success case prop solver time : 0.000
% 29.84/4.50 # Current number of processed clauses : 2534
% 29.84/4.50 # Positive orientable unit clauses : 292
% 29.84/4.50 # Positive unorientable unit clauses: 0
% 29.84/4.50 # Negative unit clauses : 143
% 29.84/4.50 # Non-unit-clauses : 2099
% 29.84/4.50 # Current number of unprocessed clauses: 191836
% 29.84/4.50 # ...number of literals in the above : 989844
% 29.84/4.50 # Current number of archived formulas : 0
% 29.84/4.50 # Current number of archived clauses : 371
% 29.84/4.50 # Clause-clause subsumption calls (NU) : 557474
% 29.84/4.50 # Rec. Clause-clause subsumption calls : 190999
% 29.84/4.50 # Non-unit clause-clause subsumptions : 4181
% 29.84/4.50 # Unit Clause-clause subsumption calls : 22700
% 29.84/4.50 # Rewrite failures with RHS unbound : 0
% 29.84/4.50 # BW rewrite match attempts : 358
% 29.84/4.50 # BW rewrite match successes : 39
% 29.84/4.50 # Condensation attempts : 0
% 29.84/4.50 # Condensation successes : 0
% 29.84/4.50 # Termbank termtop insertions : 4260849
% 29.84/4.50
% 29.84/4.50 # -------------------------------------------------
% 29.84/4.50 # User time : 3.575 s
% 29.84/4.50 # System time : 0.139 s
% 29.84/4.50 # Total time : 3.714 s
% 29.84/4.50 # Maximum resident set size: 2244 pages
% 29.84/4.50
% 29.84/4.50 # -------------------------------------------------
% 29.84/4.50 # User time : 3.580 s
% 29.84/4.50 # System time : 0.141 s
% 29.84/4.50 # Total time : 3.721 s
% 29.84/4.50 # Maximum resident set size: 1876 pages
% 29.84/4.50 % E---3.1 exiting
% 29.84/4.51 % E---3.1 exiting
%------------------------------------------------------------------------------