TSTP Solution File: SYO501_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO501_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:32 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO501_8 : TPTP v8.2.0. Released v8.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 10:25:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.53 Running first-order model finding
% 0.21/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 15106 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 15109 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% 0.21/0.54 tff(decl_22, type, x: $i).
% 0.21/0.54 tff(decl_23, type, y: $o).
% 0.21/0.54 tff(decl_24, type, f: ($i * $o) > $i).
% 0.21/0.54 tff(decl_25, type, p: $i > $o).
% 0.21/0.54 fof(claim, conjecture, (~(p(f(x,~(~(y)))))|p(f(x,y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', claim)).
% 0.21/0.54 fof(c_0_1, negated_conjecture, ~((~(((~y|p(f(x,$true)))&(y|p(f(x,$false)))))|((~y|p(f(x,$true)))&(y|p(f(x,$false)))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[claim])])])).
% 0.21/0.54 fof(c_0_2, negated_conjecture, (((~y|p(f(x,$true)))&(y|p(f(x,$false))))&(((~y|y)&(~p(f(x,$false))|y))&((~y|~p(f(x,$true)))&(~p(f(x,$false))|~p(f(x,$true)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
% 0.21/0.54 cnf(c_0_3, negated_conjecture, (y|~p(f(x,$false))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.54 cnf(c_0_4, negated_conjecture, (y|p(f(x,$false))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.54 cnf(c_0_5, negated_conjecture, (~y|~p(f(x,$true))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.54 cnf(c_0_6, negated_conjecture, (y), inference(csr,[status(thm)],[c_0_3, c_0_4])).
% 0.21/0.54 cnf(c_0_7, negated_conjecture, (p(f(x,$true))|~y), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.54 cnf(c_0_8, negated_conjecture, (~p(f(x,$true))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])])).
% 0.21/0.54 cnf(c_0_9, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_6])]), c_0_8]), ['proof']).
% 0.21/0.54 # SZS output end CNFRefutation
% 0.21/0.54 # Parsed axioms : 5
% 0.21/0.54 # Removed by relevancy pruning/SinE : 4
% 0.21/0.54 # Initial clauses : 6
% 0.21/0.54 # Removed in clause preprocessing : 1
% 0.21/0.54 # Initial clauses in saturation : 5
% 0.21/0.54 # Processed clauses : 6
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 1
% 0.21/0.54 # ...remaining for further processing : 4
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 0
% 0.21/0.54 # ...of the previous two non-redundant : 1
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 1
% 0.21/0.54 # Paramodulations : 0
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 3
% 0.21/0.54 # ...of those cached : 2
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 2
% 0.21/0.54 # Positive orientable unit clauses : 1
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 1
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 0
% 0.21/0.54 # ...number of literals in the above : 0
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 2
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1
% 0.21/0.54 # Non-unit clause-clause subsumptions : 1
% 0.21/0.54 # Unit Clause-clause subsumption calls : 0
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 1
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 259
% 0.21/0.54 # Search garbage collected termcells : 32
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.002 s
% 0.21/0.54 # System time : 0.001 s
% 0.21/0.54 # Total time : 0.004 s
% 0.21/0.54 # Maximum resident set size: 1624 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.004 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.006 s
% 0.21/0.54 # Maximum resident set size: 1684 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------