TSTP Solution File: CSR124_8 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR124_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Sat May 4 07:34:30 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : CSR124_8 : TPTP v8.1.2. Released v8.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 15:20:23 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.vA8nnDQe4O/E---3.1_30494.p
% 0.14/0.41 # Version: 3.1.0
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 30573 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 30577 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% 0.14/0.41 tff(decl_22, type, holdsDuring_THFTYPE_IiooI: ($i * $o) > $o).
% 0.14/0.41 tff(decl_23, type, lBill_THFTYPE_i: $i).
% 0.14/0.41 tff(decl_24, type, lMary_THFTYPE_i: $i).
% 0.14/0.41 tff(decl_25, type, lSue_THFTYPE_i: $i).
% 0.14/0.41 tff(decl_26, type, lYearFn_THFTYPE_IiiI: $i > $i).
% 0.14/0.41 tff(decl_27, type, likes_THFTYPE_IiioI: ($i * $i) > $o).
% 0.14/0.41 tff(decl_28, type, n2009_THFTYPE_i: $i).
% 0.14/0.41 fof(ax_001, axiom, holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), file('/export/starexec/sandbox2/tmp/tmp.vA8nnDQe4O/E---3.1_30494.p', ax_001)).
% 0.14/0.41 fof(con, conjecture, holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),(likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))), file('/export/starexec/sandbox2/tmp/tmp.vA8nnDQe4O/E---3.1_30494.p', con)).
% 0.14/0.41 fof(ax, axiom, likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i), file('/export/starexec/sandbox2/tmp/tmp.vA8nnDQe4O/E---3.1_30494.p', ax)).
% 0.14/0.41 fof(c_0_3, axiom, ((~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false))), inference(fool_unroll,[status(thm)],[ax_001])).
% 0.14/0.41 fof(c_0_4, negated_conjecture, ~(((~((likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)))|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&((likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])])).
% 0.14/0.41 fof(c_0_5, plain, ((~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false))), inference(fof_nnf,[status(thm)],[c_0_3])).
% 0.14/0.41 fof(c_0_6, negated_conjecture, ((((~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i))&(~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)))&((~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))&(~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))))&((~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
% 0.14/0.41 cnf(c_0_7, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.14/0.41 cnf(c_0_8, negated_conjecture, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.14/0.41 cnf(c_0_9, plain, (holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.14/0.41 cnf(c_0_10, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(csr,[status(thm)],[c_0_7, c_0_8])).
% 0.14/0.41 cnf(c_0_11, negated_conjecture, (~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.14/0.41 cnf(c_0_12, plain, (likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)), inference(split_conjunct,[status(thm)],[ax])).
% 0.14/0.41 cnf(c_0_13, plain, (holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])])).
% 0.14/0.41 cnf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12]), c_0_10]), c_0_13])]), ['proof']).
% 0.14/0.41 # SZS output end CNFRefutation
% 0.14/0.41 # Parsed axioms : 11
% 0.14/0.41 # Removed by relevancy pruning/SinE : 8
% 0.14/0.41 # Initial clauses : 9
% 0.14/0.41 # Removed in clause preprocessing : 2
% 0.14/0.41 # Initial clauses in saturation : 7
% 0.14/0.41 # Processed clauses : 9
% 0.14/0.41 # ...of these trivial : 1
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 7
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 3
% 0.14/0.41 # Generated clauses : 0
% 0.14/0.41 # ...of the previous two non-redundant : 2
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 1
% 0.14/0.41 # Paramodulations : 0
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Disequality decompositions : 0
% 0.14/0.41 # Total rewrite steps : 7
% 0.14/0.41 # ...of those cached : 4
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 4
% 0.14/0.41 # Positive orientable unit clauses : 3
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 0
% 0.14/0.41 # ...number of literals in the above : 0
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 3
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 1
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 1
% 0.14/0.41 # Non-unit clause-clause subsumptions : 1
% 0.14/0.41 # Unit Clause-clause subsumption calls : 0
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 2
% 0.14/0.41 # BW rewrite match successes : 2
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 360
% 0.14/0.41 # Search garbage collected termcells : 28
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.003 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.003 s
% 0.14/0.41 # Maximum resident set size: 1604 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.003 s
% 0.14/0.41 # System time : 0.003 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1684 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------