TSTP Solution File: SEU156+3 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEU156+3 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : Mon Jun 24 15:05:53 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 47 ( 20 unt; 0 def)
% Number of atoms : 87 ( 86 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 70 ( 30 ~; 29 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 9 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',d5_tarski) ).
fof(t69_enumset1,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',t69_enumset1) ).
fof(t10_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',t10_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',commutativity_k2_tarski) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',t8_zfmisc_1) ).
fof(t9_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/tmp/tmp.bRCXp3JkBn/E---3.1_27083.p',t9_zfmisc_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_8,plain,
! [X7,X8] : ordered_pair(X7,X8) = unordered_pair(unordered_pair(X7,X8),singleton(X7)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X22] : unordered_pair(X22,X22) = singleton(X22),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_10,negated_conjecture,
( ordered_pair(esk3_0,esk4_0) = ordered_pair(esk5_0,esk6_0)
& ( esk3_0 != esk5_0
| esk4_0 != esk6_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
inference(fof_simplification,[status(thm)],[t10_zfmisc_1]) ).
cnf(c_0_14,negated_conjecture,
ordered_pair(esk3_0,esk4_0) = ordered_pair(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X5,X6] : unordered_pair(X5,X6) = unordered_pair(X6,X5),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_17,plain,
! [X14,X15,X16,X17] :
( unordered_pair(X14,X15) != unordered_pair(X16,X17)
| X14 = X16
| X14 = X17 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk6_0),unordered_pair(esk5_0,esk5_0)) = unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X25,X26,X27] :
( singleton(X25) != unordered_pair(X26,X27)
| X25 = X26 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])]) ).
cnf(c_0_21,plain,
( X1 = X3
| X1 = X4
| unordered_pair(X1,X2) != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0)) = unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( X1 = unordered_pair(esk3_0,esk3_0)
| X1 = unordered_pair(esk3_0,esk4_0)
| unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( X1 = unordered_pair(esk3_0,esk4_0)
| X1 = unordered_pair(esk3_0,esk3_0)
| unordered_pair(X2,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0)
| X1 = esk3_0
| unordered_pair(X1,X1) != unordered_pair(esk5_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
fof(c_0_30,plain,
! [X28,X29,X30] :
( singleton(X28) != unordered_pair(X29,X30)
| X29 = X30 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])])]) ).
cnf(c_0_31,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk6_0) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
esk3_0 = esk5_0,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( X2 = X3
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X4,X1) != unordered_pair(X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk5_0,esk6_0) = unordered_pair(esk5_0,esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( esk3_0 != esk5_0
| esk4_0 != esk6_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,plain,
( X2 = X3
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_38,negated_conjecture,
( unordered_pair(esk5_0,esk6_0) = unordered_pair(esk5_0,esk5_0)
| X1 = esk4_0
| X1 = esk5_0
| unordered_pair(X2,X1) != unordered_pair(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
esk4_0 != esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(esk3_0,esk4_0) = unordered_pair(esk3_0,esk3_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_41,negated_conjecture,
esk6_0 = esk5_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39]),c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(X1,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk5_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_32]),c_0_32]),c_0_32]),c_0_41]) ).
cnf(c_0_43,negated_conjecture,
unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_44,negated_conjecture,
esk4_0 != esk5_0,
inference(rw,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
unordered_pair(X1,X1) != unordered_pair(esk5_0,esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_43]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU156+3 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 11:55:24 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.bRCXp3JkBn/E---3.1_27083.p
% 0.21/0.50 # Version: 3.2.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27181 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 27185 completed with status 0
% 0.21/0.50 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 12
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 13
% 0.21/0.50 # Removed in clause preprocessing : 2
% 0.21/0.50 # Initial clauses in saturation : 11
% 0.21/0.50 # Processed clauses : 296
% 0.21/0.50 # ...of these trivial : 2
% 0.21/0.50 # ...subsumed : 213
% 0.21/0.50 # ...remaining for further processing : 81
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 4
% 0.21/0.50 # Backward-rewritten : 41
% 0.21/0.50 # Generated clauses : 508
% 0.21/0.50 # ...of the previous two non-redundant : 507
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 493
% 0.21/0.50 # Factorizations : 1
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 14
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 182
% 0.21/0.50 # ...of those cached : 165
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 25
% 0.21/0.50 # Positive orientable unit clauses : 6
% 0.21/0.50 # Positive unorientable unit clauses: 1
% 0.21/0.50 # Negative unit clauses : 12
% 0.21/0.50 # Non-unit-clauses : 6
% 0.21/0.50 # Current number of unprocessed clauses: 128
% 0.21/0.50 # ...number of literals in the above : 343
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 58
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 939
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 899
% 0.21/0.50 # Non-unit clause-clause subsumptions : 133
% 0.21/0.50 # Unit Clause-clause subsumption calls : 74
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 15
% 0.21/0.50 # BW rewrite match successes : 15
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 7621
% 0.21/0.50 # Search garbage collected termcells : 123
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.013 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.017 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.058 s
% 0.21/0.50 # System time : 0.008 s
% 0.21/0.50 # Total time : 0.066 s
% 0.21/0.50 # Maximum resident set size: 1692 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------