TSTP Solution File: SEU150+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:24:57 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/tmp/tmp.CUYXwMd9U1/E---3.1_350.p',t9_zfmisc_1) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.CUYXwMd9U1/E---3.1_350.p',t8_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.CUYXwMd9U1/E---3.1_350.p',commutativity_k2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).
fof(c_0_4,lemma,
! [X20,X21,X22] :
( singleton(X20) != unordered_pair(X21,X22)
| X20 = X21 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).
fof(c_0_5,negated_conjecture,
( singleton(esk1_0) = unordered_pair(esk2_0,esk3_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X8,X9] : unordered_pair(X8,X9) = unordered_pair(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_9,negated_conjecture,
( X1 = esk2_0
| singleton(X1) != singleton(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk1_0,
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
unordered_pair(esk1_0,esk3_0) = singleton(esk1_0),
inference(rw,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( X1 = esk3_0
| singleton(X1) != singleton(esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk3_0 != esk1_0,
inference(rw,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n031.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:36:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.CUYXwMd9U1/E---3.1_350.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 430 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.20/0.50 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 433 completed with status 0
% 0.20/0.50 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 73
% 0.20/0.50 # Removed by relevancy pruning/SinE : 25
% 0.20/0.50 # Initial clauses : 83
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 83
% 0.20/0.50 # Processed clauses : 56
% 0.20/0.50 # ...of these trivial : 3
% 0.20/0.50 # ...subsumed : 3
% 0.20/0.50 # ...remaining for further processing : 50
% 0.20/0.50 # Other redundant clauses eliminated : 7
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 3
% 0.20/0.50 # Generated clauses : 91
% 0.20/0.50 # ...of the previous two non-redundant : 39
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 81
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 11
% 0.20/0.50 # Total rewrite steps : 65
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 40
% 0.20/0.50 # Positive orientable unit clauses : 22
% 0.20/0.50 # Positive unorientable unit clauses: 3
% 0.20/0.50 # Negative unit clauses : 4
% 0.20/0.50 # Non-unit-clauses : 11
% 0.20/0.50 # Current number of unprocessed clauses: 66
% 0.20/0.50 # ...number of literals in the above : 170
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 22
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 17
% 0.20/0.50 # Non-unit clause-clause subsumptions : 2
% 0.20/0.50 # Unit Clause-clause subsumption calls : 8
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 26
% 0.20/0.50 # BW rewrite match successes : 19
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4459
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1920 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1736 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------