TSTP Solution File: SYO195_8 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYO195_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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 20:43:48 EDT 2023

% Result   : Theorem 0.22s 0.49s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO195_8 : TPTP v8.1.2. Released v8.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 15:55:29 EDT 2023
% 0.21/0.35  % CPUTime    : 
% 0.22/0.48  Running first-order theorem proving
% 0.22/0.48  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.PNK4ZYvGy5/E---3.1_11288.p
% 0.22/0.49  # Version: 3.1pre001
% 0.22/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49  # Starting sh5l with 300s (1) cores
% 0.22/0.49  # new_bool_3 with pid 11414 completed with status 0
% 0.22/0.49  # Result found by new_bool_3
% 0.22/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49  # Search class: FUHPF-FFSF00-SFFFFFNN
% 0.22/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.49  # SAT001_MinMin_p005000_rr_RG with pid 11419 completed with status 0
% 0.22/0.49  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.49  # Search class: FUHPF-FFSF00-SFFFFFNN
% 0.22/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.49  # Preprocessing time       : 0.001 s
% 0.22/0.49  # Presaturation interreduction done
% 0.22/0.49  
% 0.22/0.49  # Proof found!
% 0.22/0.49  # SZS status Theorem
% 0.22/0.49  # SZS output start CNFRefutation
% 0.22/0.49  fof(cCT25, conjecture, ~(![X1:$o, X2:$o]:((X1<=>X2))), file('/export/starexec/sandbox2/tmp/tmp.PNK4ZYvGy5/E---3.1_11288.p', cCT25)).
% 0.22/0.49  fof(c_0_1, negated_conjecture, ~(~(![X1:$o, X2:$o]:((X1<=>X2)))), inference(assume_negation,[status(cth)],[cCT25])).
% 0.22/0.49  fof(c_0_2, negated_conjecture, ![X3:$o, X4:$o]:(((~X3|X4)&(~X4|X3))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])).
% 0.22/0.49  cnf(c_0_3, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2])])]), ['proof']).
% 0.22/0.49  # SZS output end CNFRefutation
% 0.22/0.49  # Parsed axioms                        : 1
% 0.22/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.49  # Initial clauses                      : 2
% 0.22/0.49  # Removed in clause preprocessing      : 0
% 0.22/0.49  # Initial clauses in saturation        : 2
% 0.22/0.49  # Processed clauses                    : 1
% 0.22/0.49  # ...of these trivial                  : 0
% 0.22/0.49  # ...subsumed                          : 0
% 0.22/0.49  # ...remaining for further processing  : 0
% 0.22/0.49  # Other redundant clauses eliminated   : 0
% 0.22/0.49  # Clauses deleted for lack of memory   : 0
% 0.22/0.49  # Backward-subsumed                    : 0
% 0.22/0.49  # Backward-rewritten                   : 0
% 0.22/0.49  # Generated clauses                    : 0
% 0.22/0.49  # ...of the previous two non-redundant : 0
% 0.22/0.49  # ...aggressively subsumed             : 0
% 0.22/0.49  # Contextual simplify-reflections      : 0
% 0.22/0.49  # Paramodulations                      : 0
% 0.22/0.49  # Factorizations                       : 0
% 0.22/0.49  # NegExts                              : 0
% 0.22/0.49  # Equation resolutions                 : 0
% 0.22/0.49  # Total rewrite steps                  : 0
% 0.22/0.49  # Propositional unsat checks           : 0
% 0.22/0.49  #    Propositional check models        : 0
% 0.22/0.49  #    Propositional check unsatisfiable : 0
% 0.22/0.49  #    Propositional clauses             : 0
% 0.22/0.49  #    Propositional clauses after purity: 0
% 0.22/0.49  #    Propositional unsat core size     : 0
% 0.22/0.49  #    Propositional preprocessing time  : 0.000
% 0.22/0.49  #    Propositional encoding time       : 0.000
% 0.22/0.49  #    Propositional solver time         : 0.000
% 0.22/0.49  #    Success case prop preproc time    : 0.000
% 0.22/0.49  #    Success case prop encoding time   : 0.000
% 0.22/0.49  #    Success case prop solver time     : 0.000
% 0.22/0.49  # Current number of processed clauses  : 0
% 0.22/0.49  #    Positive orientable unit clauses  : 0
% 0.22/0.49  #    Positive unorientable unit clauses: 0
% 0.22/0.49  #    Negative unit clauses             : 0
% 0.22/0.49  #    Non-unit-clauses                  : 0
% 0.22/0.49  # Current number of unprocessed clauses: 1
% 0.22/0.49  # ...number of literals in the above   : 0
% 0.22/0.49  # Current number of archived formulas  : 0
% 0.22/0.49  # Current number of archived clauses   : 0
% 0.22/0.49  # Clause-clause subsumption calls (NU) : 0
% 0.22/0.49  # Rec. Clause-clause subsumption calls : 0
% 0.22/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.49  # Unit Clause-clause subsumption calls : 0
% 0.22/0.49  # Rewrite failures with RHS unbound    : 0
% 0.22/0.49  # BW rewrite match attempts            : 0
% 0.22/0.49  # BW rewrite match successes           : 0
% 0.22/0.49  # Condensation attempts                : 0
% 0.22/0.49  # Condensation successes               : 0
% 0.22/0.49  # Termbank termtop insertions          : 57
% 0.22/0.49  
% 0.22/0.49  # -------------------------------------------------
% 0.22/0.49  # User time                : 0.003 s
% 0.22/0.49  # System time              : 0.000 s
% 0.22/0.49  # Total time               : 0.003 s
% 0.22/0.49  # Maximum resident set size: 1628 pages
% 0.22/0.49  
% 0.22/0.49  # -------------------------------------------------
% 0.22/0.49  # User time                : 0.003 s
% 0.22/0.49  # System time              : 0.003 s
% 0.22/0.49  # Total time               : 0.007 s
% 0.22/0.49  # Maximum resident set size: 1656 pages
% 0.22/0.49  % E---3.1 exiting
% 0.22/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------