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