TSTP Solution File: PUZ137_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ137_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 02:25:19 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ137_8 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 10:54:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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 27637 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 27640 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 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
% 0.20/0.50 tff(decl_22, type, peter: $i).
% 0.20/0.50 tff(decl_23, type, says: ($i * $o) > $o).
% 0.20/0.50 tff(decl_24, type, epred1_0: $o).
% 0.20/0.50 tff(decl_25, type, epred2_0: $o).
% 0.20/0.50 fof(ax1, axiom, says(peter,![X1:$o]:((says(peter,X1)=>~(X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax1)).
% 0.20/0.50 fof(thm, conjecture, ![X1:$o]:(says(peter,X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thm)).
% 0.20/0.50 fof(c_0_2, plain, ((~(![X1:$o]:((says(peter,X1)=>~X1)))|says(peter,$true))&(![X1:$o]:((says(peter,X1)=>~X1))|says(peter,$false))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax1])])).
% 0.20/0.50 fof(c_0_3, negated_conjecture, ~(![X1:$o]:(says(peter,X1))), inference(assume_negation,[status(cth)],[thm])).
% 0.20/0.50 fof(c_0_4, plain, ![X4:$o]:(((((~epred2_0|says(peter,$true)|says(peter,$true))&(epred2_0|says(peter,$false)|says(peter,$true)))&(epred2_0|says(peter,$true)))&(~says(peter,X4)|~X4|says(peter,$false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])])).
% 0.20/0.50 fof(c_0_5, negated_conjecture, (((~epred1_0|epred1_0)&(~says(peter,$false)|epred1_0))&((~epred1_0|~says(peter,$true))&(~says(peter,$false)|~says(peter,$true)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])).
% 0.20/0.50 cnf(c_0_6, plain, (says(peter,$true)|says(peter,$true)|~epred2_0), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.20/0.50 cnf(c_0_7, plain, (says(peter,$false)|~says(peter,$true)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])).
% 0.20/0.50 cnf(c_0_8, negated_conjecture, (~says(peter,$false)|~says(peter,$true)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.50 cnf(c_0_9, plain, (says(peter,$true)|~epred2_0), inference(cn,[status(thm)],[c_0_6])).
% 0.20/0.50 cnf(c_0_10, plain, (~says(peter,$true)), inference(csr,[status(thm)],[c_0_7, c_0_8])).
% 0.20/0.50 cnf(c_0_11, plain, (epred2_0|says(peter,$true)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.20/0.50 cnf(c_0_12, plain, (~epred2_0), inference(sr,[status(thm)],[c_0_9, c_0_10])).
% 0.20/0.50 cnf(c_0_13, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11, c_0_12]), c_0_10]), ['proof']).
% 0.20/0.50 # SZS output end CNFRefutation
% 0.20/0.50 # Parsed axioms : 4
% 0.20/0.50 # Removed by relevancy pruning/SinE : 2
% 0.20/0.50 # Initial clauses : 8
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 7
% 0.20/0.50 # Processed clauses : 6
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 5
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 2
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 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 : 3
% 0.20/0.50 # Positive orientable unit clauses : 0
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 1
% 0.20/0.50 # Current number of unprocessed clauses: 1
% 0.20/0.50 # ...number of literals in the above : 3
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 2
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.50 # Non-unit clause-clause subsumptions : 1
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 338
% 0.20/0.50 # Search garbage collected termcells : 84
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1608 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1688 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------