TSTP Solution File: SEU186+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU186+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:30:47 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 88 ( 18 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 86 ( 35 ~; 25 |; 12 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn; 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',rc1_xboole_0) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',rc1_relat_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',d2_subset_1) ).
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',t56_relat_1) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',existence_m1_subset_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.axYGAVGyHl/E---3.1_32198.p',d1_relat_1) ).
fof(c_0_7,plain,
! [X28] :
( ~ empty(X28)
| X28 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_8,plain,
empty(esk11_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_9,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
empty_set = esk11_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_12,plain,
( empty(esk8_0)
& relation(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_13,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t56_relat_1])]) ).
cnf(c_0_15,plain,
( X1 = esk11_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,plain,
empty(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X59,X60] :
( ( ~ element(X60,X59)
| in(X60,X59)
| empty(X59) )
& ( ~ in(X60,X59)
| element(X60,X59)
| empty(X59) )
& ( ~ element(X60,X59)
| empty(X60)
| ~ empty(X59) )
& ( ~ empty(X60)
| element(X60,X59)
| ~ empty(X59) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X169] : element(esk19_1(X169),X169),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_19,negated_conjecture,
! [X8,X9] :
( relation(esk1_0)
& ~ in(ordered_pair(X8,X9),esk1_0)
& esk1_0 != empty_set ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_20,plain,
! [X40,X41,X44,X46,X47] :
( ( ~ relation(X40)
| ~ in(X41,X40)
| X41 = ordered_pair(esk5_2(X40,X41),esk6_2(X40,X41)) )
& ( in(esk7_1(X44),X44)
| relation(X44) )
& ( esk7_1(X44) != ordered_pair(X46,X47)
| relation(X44) ) ),
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)],[d1_relat_1])])])])])]) ).
cnf(c_0_21,plain,
esk11_0 = esk8_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
element(esk19_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ in(ordered_pair(X1,X2),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( X2 = ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2))
| ~ relation(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( X1 = esk8_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_28,plain,
( empty(X1)
| in(esk19_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
esk11_0 != esk1_0,
inference(rw,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( ~ relation(X1)
| ~ in(X2,esk1_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( X1 = esk8_0
| in(esk19_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
esk8_0 != esk1_0,
inference(rw,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( ~ relation(X1)
| ~ in(esk19_1(esk1_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,negated_conjecture,
~ in(esk19_1(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SEU186+2 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 09:46:36 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.axYGAVGyHl/E---3.1_32198.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_3 with pid 32279 completed with status 0
% 0.20/0.52 # Result found by new_bool_3
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.52 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 32282 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.52 # Preprocessing time : 0.003 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 164
% 0.20/0.52 # Removed by relevancy pruning/SinE : 84
% 0.20/0.52 # Initial clauses : 133
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 133
% 0.20/0.52 # Processed clauses : 631
% 0.20/0.52 # ...of these trivial : 6
% 0.20/0.52 # ...subsumed : 266
% 0.20/0.52 # ...remaining for further processing : 359
% 0.20/0.52 # Other redundant clauses eliminated : 32
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 3
% 0.20/0.52 # Backward-rewritten : 31
% 0.20/0.52 # Generated clauses : 1097
% 0.20/0.52 # ...of the previous two non-redundant : 888
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 1064
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 34
% 0.20/0.52 # Total rewrite steps : 406
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 191
% 0.20/0.52 # Positive orientable unit clauses : 44
% 0.20/0.52 # Positive unorientable unit clauses: 2
% 0.20/0.52 # Negative unit clauses : 28
% 0.20/0.52 # Non-unit-clauses : 117
% 0.20/0.52 # Current number of unprocessed clauses: 501
% 0.20/0.52 # ...number of literals in the above : 1151
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 148
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3854
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 2940
% 0.20/0.52 # Non-unit clause-clause subsumptions : 117
% 0.20/0.52 # Unit Clause-clause subsumption calls : 239
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 57
% 0.20/0.52 # BW rewrite match successes : 39
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 15995
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.034 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.039 s
% 0.20/0.52 # Maximum resident set size: 2200 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.037 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.044 s
% 0.20/0.52 # Maximum resident set size: 1836 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------