TSTP Solution File: SEU250+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU250+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:31:09 EDT 2023
% Result : Theorem 8.27s 1.52s
% Output : CNFRefutation 8.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 3 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 22 |; 7 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_wellord1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_field(relation_restriction(X3,X2)))
=> ( in(X1,relation_field(X3))
& in(X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.umz9wEQUL3/E---3.1_9023.p',t19_wellord1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.umz9wEQUL3/E---3.1_9023.p',d3_tarski) ).
fof(t20_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))
& subset(relation_field(relation_restriction(X2,X1)),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.umz9wEQUL3/E---3.1_9023.p',t20_wellord1) ).
fof(c_0_3,lemma,
! [X108,X109,X110] :
( ( in(X108,relation_field(X110))
| ~ in(X108,relation_field(relation_restriction(X110,X109)))
| ~ relation(X110) )
& ( in(X108,X109)
| ~ in(X108,relation_field(relation_restriction(X110,X109)))
| ~ relation(X110) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_wellord1])])]) ).
fof(c_0_4,plain,
! [X24,X25,X26,X27,X28] :
( ( ~ subset(X24,X25)
| ~ in(X26,X24)
| in(X26,X25) )
& ( in(esk6_2(X27,X28),X27)
| subset(X27,X28) )
& ( ~ in(esk6_2(X27,X28),X28)
| subset(X27,X28) ) ),
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_5,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( subset(relation_field(relation_restriction(X2,X1)),relation_field(X2))
& subset(relation_field(relation_restriction(X2,X1)),X1) ) ),
inference(assume_negation,[status(cth)],[t20_wellord1]) ).
cnf(c_0_6,lemma,
( in(X1,relation_field(X2))
| ~ in(X1,relation_field(relation_restriction(X2,X3)))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( in(esk6_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( relation(esk2_0)
& ( ~ subset(relation_field(relation_restriction(esk2_0,esk1_0)),relation_field(esk2_0))
| ~ subset(relation_field(relation_restriction(esk2_0,esk1_0)),esk1_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,lemma,
( subset(relation_field(relation_restriction(X1,X2)),X3)
| in(esk6_2(relation_field(relation_restriction(X1,X2)),X3),relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,lemma,
( in(X1,X2)
| ~ in(X1,relation_field(relation_restriction(X3,X2)))
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(relation_field(relation_restriction(esk2_0,esk1_0)),relation_field(esk2_0))
| ~ subset(relation_field(relation_restriction(esk2_0,esk1_0)),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,lemma,
( subset(relation_field(relation_restriction(X1,X2)),relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,lemma,
( subset(relation_field(relation_restriction(X1,X2)),X3)
| in(esk6_2(relation_field(relation_restriction(X1,X2)),X3),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
~ subset(relation_field(relation_restriction(esk2_0,esk1_0)),esk1_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_17,lemma,
( subset(relation_field(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_18,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU250+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:28:24 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.umz9wEQUL3/E---3.1_9023.p
% 8.27/1.52 # Version: 3.1pre001
% 8.27/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.27/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.27/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.27/1.52 # Starting new_bool_1 with 300s (1) cores
% 8.27/1.52 # Starting sh5l with 300s (1) cores
% 8.27/1.52 # sh5l with pid 9103 completed with status 0
% 8.27/1.52 # Result found by sh5l
% 8.27/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.27/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.27/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.27/1.52 # Starting new_bool_1 with 300s (1) cores
% 8.27/1.52 # Starting sh5l with 300s (1) cores
% 8.27/1.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.27/1.52 # Search class: FGHSM-FSLM32-MFFFFFNN
% 8.27/1.52 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 8.27/1.52 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 8.27/1.52 # G-E--_303_C18_F1_URBAN_S0Y with pid 9106 completed with status 0
% 8.27/1.52 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 8.27/1.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 8.27/1.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.27/1.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.27/1.52 # Starting new_bool_3 with 300s (1) cores
% 8.27/1.52 # Starting new_bool_1 with 300s (1) cores
% 8.27/1.52 # Starting sh5l with 300s (1) cores
% 8.27/1.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.27/1.52 # Search class: FGHSM-FSLM32-MFFFFFNN
% 8.27/1.52 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 8.27/1.52 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 8.27/1.52 # Preprocessing time : 0.011 s
% 8.27/1.52
% 8.27/1.52 # Proof found!
% 8.27/1.52 # SZS status Theorem
% 8.27/1.52 # SZS output start CNFRefutation
% See solution above
% 8.27/1.52 # Parsed axioms : 308
% 8.27/1.52 # Removed by relevancy pruning/SinE : 25
% 8.27/1.52 # Initial clauses : 613
% 8.27/1.52 # Removed in clause preprocessing : 4
% 8.27/1.52 # Initial clauses in saturation : 609
% 8.27/1.52 # Processed clauses : 3205
% 8.27/1.52 # ...of these trivial : 42
% 8.27/1.52 # ...subsumed : 1467
% 8.27/1.52 # ...remaining for further processing : 1696
% 8.27/1.52 # Other redundant clauses eliminated : 94
% 8.27/1.52 # Clauses deleted for lack of memory : 0
% 8.27/1.52 # Backward-subsumed : 116
% 8.27/1.52 # Backward-rewritten : 92
% 8.27/1.52 # Generated clauses : 33276
% 8.27/1.52 # ...of the previous two non-redundant : 31623
% 8.27/1.52 # ...aggressively subsumed : 0
% 8.27/1.52 # Contextual simplify-reflections : 117
% 8.27/1.52 # Paramodulations : 33085
% 8.27/1.52 # Factorizations : 20
% 8.27/1.52 # NegExts : 0
% 8.27/1.52 # Equation resolutions : 169
% 8.27/1.52 # Total rewrite steps : 4287
% 8.27/1.52 # Propositional unsat checks : 0
% 8.27/1.52 # Propositional check models : 0
% 8.27/1.52 # Propositional check unsatisfiable : 0
% 8.27/1.52 # Propositional clauses : 0
% 8.27/1.52 # Propositional clauses after purity: 0
% 8.27/1.52 # Propositional unsat core size : 0
% 8.27/1.52 # Propositional preprocessing time : 0.000
% 8.27/1.52 # Propositional encoding time : 0.000
% 8.27/1.52 # Propositional solver time : 0.000
% 8.27/1.52 # Success case prop preproc time : 0.000
% 8.27/1.52 # Success case prop encoding time : 0.000
% 8.27/1.52 # Success case prop solver time : 0.000
% 8.27/1.52 # Current number of processed clauses : 1479
% 8.27/1.52 # Positive orientable unit clauses : 122
% 8.27/1.52 # Positive unorientable unit clauses: 3
% 8.27/1.52 # Negative unit clauses : 142
% 8.27/1.52 # Non-unit-clauses : 1212
% 8.27/1.52 # Current number of unprocessed clauses: 28648
% 8.27/1.52 # ...number of literals in the above : 132886
% 8.27/1.52 # Current number of archived formulas : 0
% 8.27/1.52 # Current number of archived clauses : 210
% 8.27/1.52 # Clause-clause subsumption calls (NU) : 320559
% 8.27/1.52 # Rec. Clause-clause subsumption calls : 141831
% 8.27/1.52 # Non-unit clause-clause subsumptions : 1027
% 8.27/1.52 # Unit Clause-clause subsumption calls : 19261
% 8.27/1.52 # Rewrite failures with RHS unbound : 0
% 8.27/1.52 # BW rewrite match attempts : 91
% 8.27/1.52 # BW rewrite match successes : 52
% 8.27/1.52 # Condensation attempts : 0
% 8.27/1.52 # Condensation successes : 0
% 8.27/1.52 # Termbank termtop insertions : 492724
% 8.27/1.52
% 8.27/1.52 # -------------------------------------------------
% 8.27/1.52 # User time : 0.984 s
% 8.27/1.52 # System time : 0.028 s
% 8.27/1.52 # Total time : 1.012 s
% 8.27/1.52 # Maximum resident set size: 3860 pages
% 8.27/1.52
% 8.27/1.52 # -------------------------------------------------
% 8.27/1.52 # User time : 0.992 s
% 8.27/1.52 # System time : 0.029 s
% 8.27/1.52 # Total time : 1.021 s
% 8.27/1.52 # Maximum resident set size: 2012 pages
% 8.27/1.52 % E---3.1 exiting
%------------------------------------------------------------------------------