TSTP Solution File: PUZ004-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ004-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:24:11 EDT 2024
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 13 unt; 2 nHn; 39 RR)
% Number of literals : 65 ( 0 equ; 35 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 11 ( 10 usr; 11 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(brown_starts_with_sir,axiom,
( begins_with_dear_sir
| ~ by_brown ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',brown_starts_with_sir) ).
cnf(no_dear_sirs_in_third_person,axiom,
( ~ begins_with_dear_sir
| ~ in_third_person ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_dear_sirs_in_third_person) ).
cnf(letter_by_brown,hypothesis,
by_brown,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',letter_by_brown) ).
cnf(black_ink_in_third_person,axiom,
( in_third_person
| ~ in_black_ink ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',black_ink_in_third_person) ).
cnf(not_filed_if_read,axiom,
( ~ can_be_read
| ~ filed ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_filed_if_read) ).
cnf(filed_if_on_blue_paper,axiom,
( filed
| ~ on_blue_paper ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',filed_if_on_blue_paper) ).
cnf(prove_it_cannot_be_read,negated_conjecture,
can_be_read,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_it_cannot_be_read) ).
cnf(on_one_sheet_if_crossed,axiom,
( on_one_sheet
| ~ crossed ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',on_one_sheet_if_crossed) ).
cnf(not_crossed_in_black_ink,axiom,
( crossed
| in_black_ink ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_crossed_in_black_ink) ).
cnf(dated_on_blue_paper,axiom,
( on_blue_paper
| ~ dated ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dated_on_blue_paper) ).
cnf(dated_if_on_one_sheet,axiom,
( dated
| ~ on_one_sheet ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dated_if_on_one_sheet) ).
cnf(c_0_11,plain,
( begins_with_dear_sir
| ~ by_brown ),
inference(fof_simplification,[status(thm)],[brown_starts_with_sir]) ).
cnf(c_0_12,plain,
( ~ begins_with_dear_sir
| ~ in_third_person ),
inference(fof_simplification,[status(thm)],[no_dear_sirs_in_third_person]) ).
cnf(c_0_13,plain,
( begins_with_dear_sir
| ~ by_brown ),
c_0_11 ).
cnf(c_0_14,hypothesis,
by_brown,
letter_by_brown ).
cnf(c_0_15,plain,
( in_third_person
| ~ in_black_ink ),
inference(fof_simplification,[status(thm)],[black_ink_in_third_person]) ).
cnf(c_0_16,plain,
( ~ begins_with_dear_sir
| ~ in_third_person ),
c_0_12 ).
cnf(c_0_17,plain,
begins_with_dear_sir,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_18,plain,
( ~ can_be_read
| ~ filed ),
inference(fof_simplification,[status(thm)],[not_filed_if_read]) ).
cnf(c_0_19,plain,
( in_third_person
| ~ in_black_ink ),
c_0_15 ).
cnf(c_0_20,plain,
~ in_third_person,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,plain,
( filed
| ~ on_blue_paper ),
inference(fof_simplification,[status(thm)],[filed_if_on_blue_paper]) ).
cnf(c_0_22,plain,
( ~ can_be_read
| ~ filed ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
can_be_read,
prove_it_cannot_be_read ).
cnf(c_0_24,plain,
( on_one_sheet
| ~ crossed ),
inference(fof_simplification,[status(thm)],[on_one_sheet_if_crossed]) ).
cnf(c_0_25,axiom,
( crossed
| in_black_ink ),
not_crossed_in_black_ink ).
cnf(c_0_26,plain,
~ in_black_ink,
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( on_blue_paper
| ~ dated ),
inference(fof_simplification,[status(thm)],[dated_on_blue_paper]) ).
cnf(c_0_28,plain,
( filed
| ~ on_blue_paper ),
c_0_21 ).
cnf(c_0_29,plain,
~ filed,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_30,plain,
( dated
| ~ on_one_sheet ),
inference(fof_simplification,[status(thm)],[dated_if_on_one_sheet]) ).
cnf(c_0_31,plain,
( on_one_sheet
| ~ crossed ),
c_0_24 ).
cnf(c_0_32,plain,
crossed,
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( on_blue_paper
| ~ dated ),
c_0_27 ).
cnf(c_0_34,plain,
~ on_blue_paper,
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( dated
| ~ on_one_sheet ),
c_0_30 ).
cnf(c_0_36,plain,
on_one_sheet,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_37,plain,
~ dated,
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ004-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.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 : Sat May 18 10:58:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 22117 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 151s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 151s (1) cores
% 0.22/0.52 # Starting sh5l with 146s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 22121 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 901s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 12
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 12
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 12
% 0.22/0.52 # Processed clauses : 24
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 24
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 1
% 0.22/0.52 # Backward-rewritten : 2
% 0.22/0.52 # Generated clauses : 0
% 0.22/0.52 # ...of the previous two non-redundant : 1
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 0
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 5
% 0.22/0.52 # ...of those cached : 0
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 10
% 0.22/0.52 # Positive orientable unit clauses : 5
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 5
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 0
% 0.22/0.52 # ...number of literals in the above : 0
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 14
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 2
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 2
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 6
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 2
% 0.22/0.52 # BW rewrite match successes : 2
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 161
% 0.22/0.52 # Search garbage collected termcells : 19
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.004 s
% 0.22/0.52 # System time : 0.001 s
% 0.22/0.52 # Total time : 0.005 s
% 0.22/0.52 # Maximum resident set size: 1648 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.008 s
% 0.22/0.52 # System time : 0.007 s
% 0.22/0.52 # Total time : 0.015 s
% 0.22/0.52 # Maximum resident set size: 1680 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E exiting
%------------------------------------------------------------------------------