TSTP Solution File: CSR152_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR152_8 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Mon May 20 19:20:39 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR152_8 : TPTP v8.2.0. Released v8.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 01:06:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 23320 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 23323 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% 0.19/0.48 tff(decl_22, type, knows_THFTYPE_IiooI: ($i * $o) > $o).
% 0.19/0.48 tff(decl_23, type, lBill_THFTYPE_i: $i).
% 0.19/0.48 tff(decl_24, type, lChris_THFTYPE_i: $i).
% 0.19/0.48 tff(decl_25, type, lMary_THFTYPE_i: $i).
% 0.19/0.48 tff(decl_26, type, lSue_THFTYPE_i: $i).
% 0.19/0.48 tff(decl_27, type, likes_THFTYPE_IiioI: ($i * $i) > $o).
% 0.19/0.48 tff(decl_28, type, esk1_0: $i).
% 0.19/0.48 fof(ax, axiom, knows_THFTYPE_IiooI(lChris_THFTYPE_i,lChris_THFTYPE_i=lChris_THFTYPE_i), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax)).
% 0.19/0.48 fof(con, conjecture, knows_THFTYPE_IiooI(lChris_THFTYPE_i,likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', con)).
% 0.19/0.48 fof(ax_002, axiom, knows_THFTYPE_IiooI(lChris_THFTYPE_i,![X1]:((likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1)=>likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax_002)).
% 0.19/0.48 fof(ax_001, axiom, likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax_001)).
% 0.19/0.48 fof(c_0_4, axiom, ((lChris_THFTYPE_i!=lChris_THFTYPE_i|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(lChris_THFTYPE_i=lChris_THFTYPE_i|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false))), inference(fool_unroll,[status(thm)],[ax])).
% 0.19/0.48 fof(c_0_5, negated_conjecture, ~(((~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)))), inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])])).
% 0.19/0.48 fof(c_0_6, plain, ((lChris_THFTYPE_i!=lChris_THFTYPE_i|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(lChris_THFTYPE_i=lChris_THFTYPE_i|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false))), inference(fof_nnf,[status(thm)],[c_0_4])).
% 0.19/0.48 fof(c_0_7, axiom, ((~(![X1]:((likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1)=>likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1))))|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(![X1]:((likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1)=>likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)))|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false))), inference(fool_unroll,[status(thm)],[ax_002])).
% 0.19/0.48 fof(c_0_8, negated_conjecture, (((~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))&(~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)|likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)))&((~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)|~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
% 0.19/0.48 cnf(c_0_9, plain, (knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)|$false), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.19/0.48 fof(c_0_10, plain, ![X3]:((((likes_THFTYPE_IiioI(lMary_THFTYPE_i,esk1_0)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true))&(~likes_THFTYPE_IiioI(lSue_THFTYPE_i,esk1_0)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)))&(~likes_THFTYPE_IiioI(lMary_THFTYPE_i,X3)|likes_THFTYPE_IiioI(lSue_THFTYPE_i,X3)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)))), 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_7])])])])])])).
% 0.19/0.48 cnf(c_0_11, negated_conjecture, (~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)|~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.19/0.48 cnf(c_0_12, plain, (knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)), inference(cn,[status(thm)],[c_0_9])).
% 0.19/0.48 cnf(c_0_13, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)|knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)|~likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.19/0.48 cnf(c_0_14, negated_conjecture, (~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])])).
% 0.19/0.48 cnf(c_0_15, negated_conjecture, (~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|~knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.19/0.48 cnf(c_0_16, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)|~likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1)), inference(sr,[status(thm)],[c_0_13, c_0_14])).
% 0.19/0.48 cnf(c_0_17, plain, (likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)), inference(split_conjunct,[status(thm)],[ax_001])).
% 0.19/0.48 cnf(c_0_18, negated_conjecture, (~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_12])])).
% 0.19/0.48 cnf(c_0_19, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), ['proof']).
% 0.19/0.48 # SZS output end CNFRefutation
% 0.19/0.48 # Parsed axioms : 11
% 0.19/0.48 # Removed by relevancy pruning/SinE : 7
% 0.19/0.48 # Initial clauses : 10
% 0.19/0.48 # Removed in clause preprocessing : 2
% 0.19/0.48 # Initial clauses in saturation : 8
% 0.19/0.48 # Processed clauses : 13
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 10
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 1
% 0.19/0.48 # ...of the previous two non-redundant : 0
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 1
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 4
% 0.19/0.48 # ...of those cached : 3
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 5
% 0.19/0.48 # Positive orientable unit clauses : 2
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 5
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 449
% 0.19/0.48 # Search garbage collected termcells : 64
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.003 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1748 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1696 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------