TSTP Solution File: SEU187+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU187+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:30:42 EDT 2024
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 139 ( 39 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 154 ( 64 ~; 57 |; 16 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 67 ( 6 sgn 37 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',d1_xboole_0) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',rc1_xboole_0) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.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.w5DaUwUmQh/E---3.1_7629.p',d2_subset_1) ).
fof(t60_relat_1,conjecture,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',t60_relat_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',d4_relat_1) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',existence_m1_subset_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w5DaUwUmQh/E---3.1_7629.p',d5_relat_1) ).
fof(c_0_9,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_10,plain,
! [X25] :
( ~ empty(X25)
| X25 = empty_set ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_11,plain,
empty(esk12_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_12,plain,
! [X7,X8,X9] :
( ( X7 != empty_set
| ~ in(X8,X7) )
& ( in(esk1_1(X9),X9)
| X9 = empty_set ) ),
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_9])])])])])]) ).
cnf(c_0_13,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
empty(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
empty_set = esk12_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
( empty(esk10_0)
& relation(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_18,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_19,negated_conjecture,
~ ( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
inference(assume_negation,[status(cth)],[t60_relat_1]) ).
cnf(c_0_20,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( X1 = esk12_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_22,plain,
empty(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X42,X43,X44,X46,X47,X48,X50] :
( ( ~ in(X44,X43)
| in(ordered_pair(X44,esk5_3(X42,X43,X44)),X42)
| X43 != relation_dom(X42)
| ~ relation(X42) )
& ( ~ in(ordered_pair(X46,X47),X42)
| in(X46,X43)
| X43 != relation_dom(X42)
| ~ relation(X42) )
& ( ~ in(esk6_2(X42,X48),X48)
| ~ in(ordered_pair(esk6_2(X42,X48),X50),X42)
| X48 = relation_dom(X42)
| ~ relation(X42) )
& ( in(esk6_2(X42,X48),X48)
| in(ordered_pair(esk6_2(X42,X48),esk7_2(X42,X48)),X42)
| X48 = relation_dom(X42)
| ~ relation(X42) ) ),
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)],[d4_relat_1])])])])])])]) ).
fof(c_0_24,plain,
! [X65,X66] :
( ( ~ element(X66,X65)
| in(X66,X65)
| empty(X65) )
& ( ~ in(X66,X65)
| element(X66,X65)
| empty(X65) )
& ( ~ element(X66,X65)
| empty(X66)
| ~ empty(X65) )
& ( ~ empty(X66)
| element(X66,X65)
| ~ empty(X65) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
fof(c_0_25,plain,
! [X196] : element(esk26_1(X196),X196),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_26,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])]) ).
cnf(c_0_27,plain,
~ in(X1,esk12_0),
inference(rw,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_28,plain,
esk12_0 = esk10_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( in(ordered_pair(X1,esk5_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
element(esk26_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_32,plain,
! [X26,X27,X28,X30,X31,X32,X34] :
( ( ~ in(X28,X27)
| in(ordered_pair(esk2_3(X26,X27,X28),X28),X26)
| X27 != relation_rng(X26)
| ~ relation(X26) )
& ( ~ in(ordered_pair(X31,X30),X26)
| in(X30,X27)
| X27 != relation_rng(X26)
| ~ relation(X26) )
& ( ~ in(esk3_2(X26,X32),X32)
| ~ in(ordered_pair(X34,esk3_2(X26,X32)),X26)
| X32 = relation_rng(X26)
| ~ relation(X26) )
& ( in(esk3_2(X26,X32),X32)
| in(ordered_pair(esk4_2(X26,X32),esk3_2(X26,X32)),X26)
| X32 = relation_rng(X26)
| ~ relation(X26) ) ),
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)],[d5_relat_1])])])])])])]) ).
cnf(c_0_33,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
~ in(X1,esk10_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( in(ordered_pair(X1,esk5_3(X2,relation_dom(X2),X1)),X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( X1 = esk10_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_38,plain,
( empty(X1)
| in(esk26_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( in(ordered_pair(esk2_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( relation_dom(esk12_0) != esk12_0
| relation_rng(esk12_0) != esk12_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_16]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_41,plain,
~ in(X1,relation_dom(esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_42,plain,
( X1 = esk10_0
| in(esk26_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( in(ordered_pair(esk2_3(X1,relation_rng(X1),X2),X2),X1)
| ~ relation(X1)
| ~ in(X2,relation_rng(X1)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( relation_dom(esk10_0) != esk10_0
| relation_rng(esk10_0) != esk10_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_28]),c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_45,plain,
relation_dom(esk10_0) = esk10_0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
~ in(X1,relation_rng(esk10_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_43]),c_0_36])]) ).
cnf(c_0_47,negated_conjecture,
relation_rng(esk10_0) != esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU187+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.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 07:39:56 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.w5DaUwUmQh/E---3.1_7629.p
% 0.20/0.58 # Version: 3.1.0
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # new_bool_3 with pid 7759 completed with status 0
% 0.20/0.58 # Result found by new_bool_3
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.58 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.58 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 7769 completed with status 0
% 0.20/0.58 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.58 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.20/0.58 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.58 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.20/0.58 # Preprocessing time : 0.003 s
% 0.20/0.58 # Presaturation interreduction done
% 0.20/0.58
% 0.20/0.58 # Proof found!
% 0.20/0.58 # SZS status Theorem
% 0.20/0.58 # SZS output start CNFRefutation
% See solution above
% 0.20/0.58 # Parsed axioms : 167
% 0.20/0.58 # Removed by relevancy pruning/SinE : 80
% 0.20/0.58 # Initial clauses : 146
% 0.20/0.58 # Removed in clause preprocessing : 0
% 0.20/0.58 # Initial clauses in saturation : 146
% 0.20/0.58 # Processed clauses : 833
% 0.20/0.58 # ...of these trivial : 10
% 0.20/0.58 # ...subsumed : 388
% 0.20/0.58 # ...remaining for further processing : 435
% 0.20/0.58 # Other redundant clauses eliminated : 41
% 0.20/0.58 # Clauses deleted for lack of memory : 0
% 0.20/0.58 # Backward-subsumed : 2
% 0.20/0.58 # Backward-rewritten : 37
% 0.20/0.58 # Generated clauses : 2440
% 0.20/0.58 # ...of the previous two non-redundant : 2131
% 0.20/0.58 # ...aggressively subsumed : 0
% 0.20/0.58 # Contextual simplify-reflections : 0
% 0.20/0.58 # Paramodulations : 2396
% 0.20/0.58 # Factorizations : 2
% 0.20/0.58 # NegExts : 0
% 0.20/0.58 # Equation resolutions : 43
% 0.20/0.58 # Disequality decompositions : 0
% 0.20/0.58 # Total rewrite steps : 680
% 0.20/0.58 # ...of those cached : 590
% 0.20/0.58 # Propositional unsat checks : 0
% 0.20/0.58 # Propositional check models : 0
% 0.20/0.58 # Propositional check unsatisfiable : 0
% 0.20/0.58 # Propositional clauses : 0
% 0.20/0.58 # Propositional clauses after purity: 0
% 0.20/0.58 # Propositional unsat core size : 0
% 0.20/0.58 # Propositional preprocessing time : 0.000
% 0.20/0.58 # Propositional encoding time : 0.000
% 0.20/0.58 # Propositional solver time : 0.000
% 0.20/0.58 # Success case prop preproc time : 0.000
% 0.20/0.58 # Success case prop encoding time : 0.000
% 0.20/0.58 # Success case prop solver time : 0.000
% 0.20/0.58 # Current number of processed clauses : 247
% 0.20/0.58 # Positive orientable unit clauses : 51
% 0.20/0.58 # Positive unorientable unit clauses: 2
% 0.20/0.58 # Negative unit clauses : 39
% 0.20/0.58 # Non-unit-clauses : 155
% 0.20/0.58 # Current number of unprocessed clauses: 1546
% 0.20/0.58 # ...number of literals in the above : 4499
% 0.20/0.58 # Current number of archived formulas : 0
% 0.20/0.58 # Current number of archived clauses : 164
% 0.20/0.58 # Clause-clause subsumption calls (NU) : 6135
% 0.20/0.58 # Rec. Clause-clause subsumption calls : 4503
% 0.20/0.58 # Non-unit clause-clause subsumptions : 164
% 0.20/0.58 # Unit Clause-clause subsumption calls : 1034
% 0.20/0.58 # Rewrite failures with RHS unbound : 0
% 0.20/0.58 # BW rewrite match attempts : 62
% 0.20/0.58 # BW rewrite match successes : 42
% 0.20/0.58 # Condensation attempts : 0
% 0.20/0.58 # Condensation successes : 0
% 0.20/0.58 # Termbank termtop insertions : 31621
% 0.20/0.58 # Search garbage collected termcells : 2616
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.061 s
% 0.20/0.58 # System time : 0.006 s
% 0.20/0.58 # Total time : 0.067 s
% 0.20/0.58 # Maximum resident set size: 2244 pages
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.066 s
% 0.20/0.58 # System time : 0.007 s
% 0.20/0.58 # Total time : 0.073 s
% 0.20/0.58 # Maximum resident set size: 1852 pages
% 0.20/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------