TSTP Solution File: SYO506_8 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : Tue May 21 08:52:33 EDT 2024

% Result   : Theorem 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SYO506_8 : TPTP v8.2.0. Released v8.0.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n010.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Mon May 20 09:33:37 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order model finding
% 0.16/0.42  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/benchmark/theBenchmark.p
% 0.16/0.43  # Version: 3.1.0
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43  # Starting sh5l with 300s (1) cores
% 0.16/0.43  # new_bool_3 with pid 11098 completed with status 0
% 0.16/0.43  # Result found by new_bool_3
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHHPS-FFSF33-SFFFFFNN
% 0.16/0.43  # partial match(2): FHUNS-FFSF33-SFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.16/0.43  # SAT001_MinMin_p005000_rr_RG with pid 11102 completed with status 0
% 0.16/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.43  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43  # Search class: FHHPS-FFSF33-SFFFFFNN
% 0.16/0.43  # partial match(2): FHUNS-FFSF33-SFFFFFNN
% 0.16/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.16/0.43  # Preprocessing time       : 0.001 s
% 0.16/0.43  # Presaturation interreduction done
% 0.16/0.43  
% 0.16/0.43  # Proof found!
% 0.16/0.43  # SZS status Theorem
% 0.16/0.43  # SZS output start CNFRefutation
% 0.16/0.43  tff(decl_22, type, c: ($o * $i * $i) > $i).
% 0.16/0.43  tff(decl_23, type, esk1_0: $i).
% 0.16/0.43  tff(decl_24, type, esk2_0: $i).
% 0.16/0.43  fof(claim, conjecture, (![X1, X2]:(c(X1=X2,X1,X2)=X2)|~(![X1, X2]:(c($true,X1,X2)=X1))|~(![X1, X2]:(c($false,X1,X2)=X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', claim)).
% 0.16/0.43  fof(c_0_1, negated_conjecture, ~((![X1, X2]:(((X1!=X2|c($true,X1,X2)=X2)&(X1=X2|c($false,X1,X2)=X2)))|~(![X1, X2]:(c($true,X1,X2)=X1))|~(![X1, X2]:(c($false,X1,X2)=X2)))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[claim])])).
% 0.16/0.43  fof(c_0_2, negated_conjecture, ![X5, X6, X7, X8]:((((((esk1_0!=esk2_0|esk1_0=esk2_0)&(c($false,esk1_0,esk2_0)!=esk2_0|esk1_0=esk2_0))&((esk1_0!=esk2_0|c($true,esk1_0,esk2_0)!=esk2_0)&(c($false,esk1_0,esk2_0)!=esk2_0|c($true,esk1_0,esk2_0)!=esk2_0)))&c($true,X5,X6)=X5)&c($false,X7,X8)=X8)), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
% 0.16/0.43  cnf(c_0_3, negated_conjecture, (esk1_0!=esk2_0|c($true,esk1_0,esk2_0)!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.43  cnf(c_0_4, negated_conjecture, (c($true,X1,X2)=X1), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.43  cnf(c_0_5, negated_conjecture, (esk1_0=esk2_0|c($false,esk1_0,esk2_0)!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.43  cnf(c_0_6, negated_conjecture, (c($false,X1,X2)=X2), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.43  cnf(c_0_7, negated_conjecture, (esk1_0!=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3, c_0_4])])).
% 0.16/0.43  cnf(c_0_8, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])]), c_0_7]), ['proof']).
% 0.16/0.43  # SZS output end CNFRefutation
% 0.16/0.43  # Parsed axioms                        : 2
% 0.16/0.43  # Removed by relevancy pruning/SinE    : 1
% 0.16/0.43  # Initial clauses                      : 6
% 0.16/0.43  # Removed in clause preprocessing      : 1
% 0.16/0.43  # Initial clauses in saturation        : 5
% 0.16/0.43  # Processed clauses                    : 7
% 0.16/0.43  # ...of these trivial                  : 0
% 0.16/0.43  # ...subsumed                          : 1
% 0.16/0.43  # ...remaining for further processing  : 6
% 0.16/0.43  # Other redundant clauses eliminated   : 0
% 0.16/0.43  # Clauses deleted for lack of memory   : 0
% 0.16/0.43  # Backward-subsumed                    : 0
% 0.16/0.43  # Backward-rewritten                   : 3
% 0.16/0.43  # Generated clauses                    : 0
% 0.16/0.43  # ...of the previous two non-redundant : 2
% 0.16/0.43  # ...aggressively subsumed             : 0
% 0.16/0.43  # Contextual simplify-reflections      : 0
% 0.16/0.43  # Paramodulations                      : 0
% 0.16/0.43  # Factorizations                       : 0
% 0.16/0.43  # NegExts                              : 0
% 0.16/0.43  # Equation resolutions                 : 0
% 0.16/0.43  # Disequality decompositions           : 0
% 0.16/0.43  # Total rewrite steps                  : 3
% 0.16/0.43  # ...of those cached                   : 1
% 0.16/0.43  # Propositional unsat checks           : 0
% 0.16/0.43  #    Propositional check models        : 0
% 0.16/0.43  #    Propositional check unsatisfiable : 0
% 0.16/0.43  #    Propositional clauses             : 0
% 0.16/0.43  #    Propositional clauses after purity: 0
% 0.16/0.43  #    Propositional unsat core size     : 0
% 0.16/0.43  #    Propositional preprocessing time  : 0.000
% 0.16/0.43  #    Propositional encoding time       : 0.000
% 0.16/0.43  #    Propositional solver time         : 0.000
% 0.16/0.43  #    Success case prop preproc time    : 0.000
% 0.16/0.43  #    Success case prop encoding time   : 0.000
% 0.16/0.43  #    Success case prop solver time     : 0.000
% 0.16/0.43  # Current number of processed clauses  : 3
% 0.16/0.43  #    Positive orientable unit clauses  : 2
% 0.16/0.43  #    Positive unorientable unit clauses: 0
% 0.16/0.43  #    Negative unit clauses             : 1
% 0.16/0.43  #    Non-unit-clauses                  : 0
% 0.16/0.43  # Current number of unprocessed clauses: 0
% 0.16/0.43  # ...number of literals in the above   : 0
% 0.16/0.43  # Current number of archived formulas  : 0
% 0.16/0.43  # Current number of archived clauses   : 3
% 0.16/0.43  # Clause-clause subsumption calls (NU) : 2
% 0.16/0.43  # Rec. Clause-clause subsumption calls : 2
% 0.16/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.43  # Unit Clause-clause subsumption calls : 1
% 0.16/0.43  # Rewrite failures with RHS unbound    : 0
% 0.16/0.43  # BW rewrite match attempts            : 2
% 0.16/0.43  # BW rewrite match successes           : 2
% 0.16/0.43  # Condensation attempts                : 0
% 0.16/0.43  # Condensation successes               : 0
% 0.16/0.43  # Termbank termtop insertions          : 259
% 0.16/0.43  # Search garbage collected termcells   : 76
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.003 s
% 0.16/0.43  # System time              : 0.000 s
% 0.16/0.43  # Total time               : 0.003 s
% 0.16/0.43  # Maximum resident set size: 1784 pages
% 0.16/0.43  
% 0.16/0.43  # -------------------------------------------------
% 0.16/0.43  # User time                : 0.004 s
% 0.16/0.43  # System time              : 0.001 s
% 0.16/0.43  # Total time               : 0.005 s
% 0.16/0.43  # Maximum resident set size: 1692 pages
% 0.16/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------