TSTP Solution File: SEU187+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU187+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:09 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 110 ( 37 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 121 ( 47 ~; 58 |; 9 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-3 aty)
% Number of variables : 65 ( 1 sgn; 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.jxlTJhPLSw/E---3.1_3624.p',d5_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',commutativity_k2_tarski) ).
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.jxlTJhPLSw/E---3.1_3624.p',d4_relat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',t7_boole) ).
fof(cc1_relat_1,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',cc1_relat_1) ).
fof(t60_relat_1,conjecture,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',t60_relat_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p',fc1_xboole_0) ).
fof(c_0_8,plain,
! [X20,X21,X22,X24,X25,X26,X28] :
( ( ~ in(X22,X21)
| in(ordered_pair(esk4_3(X20,X21,X22),X22),X20)
| X21 != relation_rng(X20)
| ~ relation(X20) )
& ( ~ in(ordered_pair(X25,X24),X20)
| in(X24,X21)
| X21 != relation_rng(X20)
| ~ relation(X20) )
& ( ~ in(esk5_2(X20,X26),X26)
| ~ in(ordered_pair(X28,esk5_2(X20,X26)),X20)
| X26 = relation_rng(X20)
| ~ relation(X20) )
& ( in(esk5_2(X20,X26),X26)
| in(ordered_pair(esk6_2(X20,X26),esk5_2(X20,X26)),X20)
| X26 = relation_rng(X20)
| ~ relation(X20) ) ),
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)],[d5_relat_1])])])])])]) ).
fof(c_0_9,plain,
! [X30,X31] : ordered_pair(X30,X31) = unordered_pair(unordered_pair(X30,X31),singleton(X30)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_10,plain,
( in(esk5_2(X1,X2),X2)
| in(ordered_pair(esk6_2(X1,X2),esk5_2(X1,X2)),X1)
| X2 = relation_rng(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X8,X9] : unordered_pair(X8,X9) = unordered_pair(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_13,plain,
! [X10,X11,X12,X14,X15,X16,X18] :
( ( ~ in(X12,X11)
| in(ordered_pair(X12,esk1_3(X10,X11,X12)),X10)
| X11 != relation_dom(X10)
| ~ relation(X10) )
& ( ~ in(ordered_pair(X14,X15),X10)
| in(X14,X11)
| X11 != relation_dom(X10)
| ~ relation(X10) )
& ( ~ in(esk2_2(X10,X16),X16)
| ~ in(ordered_pair(esk2_2(X10,X16),X18),X10)
| X16 = relation_dom(X10)
| ~ relation(X10) )
& ( in(esk2_2(X10,X16),X16)
| in(ordered_pair(esk2_2(X10,X16),esk3_2(X10,X16)),X10)
| X16 = relation_dom(X10)
| ~ relation(X10) ) ),
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)],[d4_relat_1])])])])])]) ).
fof(c_0_14,plain,
! [X53,X54] :
( ~ in(X53,X54)
| ~ empty(X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_15,plain,
( X2 = relation_rng(X1)
| in(esk5_2(X1,X2),X2)
| in(unordered_pair(unordered_pair(esk6_2(X1,X2),esk5_2(X1,X2)),singleton(esk6_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X7] :
( ~ empty(X7)
| relation(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relat_1])]) ).
cnf(c_0_18,plain,
( in(esk2_2(X1,X2),X2)
| in(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)
| X2 = relation_dom(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = relation_rng(X2)
| in(unordered_pair(unordered_pair(esk5_2(X2,X1),esk6_2(X2,X1)),singleton(esk6_2(X2,X1))),X2)
| in(esk5_2(X2,X1),X1)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( relation(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( X2 = relation_dom(X1)
| in(esk2_2(X1,X2),X2)
| in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
fof(c_0_23,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_24,plain,
( X1 = relation_rng(X2)
| in(esk5_2(X2,X1),X1)
| ~ empty(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
( X1 = relation_dom(X2)
| in(unordered_pair(singleton(esk2_2(X2,X1)),unordered_pair(esk2_2(X2,X1),esk3_2(X2,X1))),X2)
| in(esk2_2(X2,X1),X1)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
fof(c_0_26,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
( X1 = relation_rng(X2)
| ~ empty(X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_28,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_29,plain,
( X1 = relation_dom(X2)
| in(esk2_2(X2,X1),X1)
| ~ empty(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_21]) ).
cnf(c_0_30,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_31,plain,
( relation_rng(X1) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( X1 = relation_dom(X2)
| ~ empty(X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
relation_dom(empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
cnf(c_0_34,plain,
( relation_dom(X1) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU187+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 09:17:22 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.jxlTJhPLSw/E---3.1_3624.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3702 completed with status 0
% 0.15/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FGHSS-FFMM31-MFFFFFNN
% 0.15/0.42 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.42 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.15/0.42 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.15/0.42 # Starting U----_206c_02_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.15/0.42 # G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 3711 completed with status 0
% 0.15/0.42 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # No SInE strategy applied
% 0.15/0.42 # Search class: FGHSS-FFMM31-MFFFFFNN
% 0.15/0.42 # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.42 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 113s (1) cores
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.42 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 32
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 42
% 0.15/0.42 # Removed in clause preprocessing : 8
% 0.15/0.42 # Initial clauses in saturation : 34
% 0.15/0.42 # Processed clauses : 64
% 0.15/0.42 # ...of these trivial : 1
% 0.15/0.42 # ...subsumed : 11
% 0.15/0.42 # ...remaining for further processing : 52
% 0.15/0.42 # Other redundant clauses eliminated : 4
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 1
% 0.15/0.42 # Backward-rewritten : 3
% 0.15/0.42 # Generated clauses : 58
% 0.15/0.42 # ...of the previous two non-redundant : 50
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 2
% 0.15/0.42 # Paramodulations : 52
% 0.15/0.42 # Factorizations : 2
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 4
% 0.15/0.42 # Total rewrite steps : 15
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 44
% 0.15/0.42 # Positive orientable unit clauses : 6
% 0.15/0.42 # Positive unorientable unit clauses: 1
% 0.15/0.42 # Negative unit clauses : 5
% 0.15/0.42 # Non-unit-clauses : 32
% 0.15/0.42 # Current number of unprocessed clauses: 18
% 0.15/0.42 # ...number of literals in the above : 64
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 5
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 193
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 176
% 0.15/0.42 # Non-unit clause-clause subsumptions : 10
% 0.15/0.42 # Unit Clause-clause subsumption calls : 12
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 4
% 0.15/0.42 # BW rewrite match successes : 4
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 2567
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.007 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1876 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.024 s
% 0.15/0.42 # System time : 0.008 s
% 0.15/0.42 # Total time : 0.032 s
% 0.15/0.42 # Maximum resident set size: 1700 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------