TSTP Solution File: PUZ013-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : PUZ013-1 : TPTP v8.1.2. Released v1.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 09:10:45 EDT 2024

% Result   : Unsatisfiable 0.22s 0.52s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   27 (  12 unt;   2 nHn;  27 RR)
%            Number of literals    :   57 (   0 equ;  32 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    8 (   7 usr;   8 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_some_monitors_are_awake,negated_conjecture,
    ~ some_monitors_are_awake,
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',prove_some_monitors_are_awake) ).

cnf(c6,axiom,
    ( some_germans_play
    | ~ some_scotch_dance_not
    | ~ some_irish_fight_not ),
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c6) ).

cnf(c10,axiom,
    ( some_irish_fight_not
    | ~ some_english_sing
    | ~ some_monitors_are_not_awake ),
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c10) ).

cnf(c13,axiom,
    ( some_monitors_are_not_awake
    | some_monitors_are_awake ),
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c13) ).

cnf(c19,axiom,
    some_scotch_dance_not,
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c19) ).

cnf(c18,axiom,
    some_english_sing,
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c18) ).

cnf(c1,axiom,
    ( some_monitors_are_awake
    | ~ some_english_sing
    | ~ some_english_sing_not ),
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c1) ).

cnf(c9,axiom,
    ( some_english_sing_not
    | ~ some_english_sing
    | ~ some_scotch_dance_not
    | ~ some_germans_play ),
    file('/export/starexec/sandbox/tmp/tmp.5curHBw0w2/E---3.1_3059.p',c9) ).

cnf(c_0_8,negated_conjecture,
    ~ some_monitors_are_awake,
    inference(fof_simplification,[status(thm)],[prove_some_monitors_are_awake]) ).

cnf(c_0_9,plain,
    ( some_germans_play
    | ~ some_scotch_dance_not
    | ~ some_irish_fight_not ),
    inference(fof_simplification,[status(thm)],[c6]) ).

cnf(c_0_10,plain,
    ( some_irish_fight_not
    | ~ some_english_sing
    | ~ some_monitors_are_not_awake ),
    inference(fof_simplification,[status(thm)],[c10]) ).

cnf(c_0_11,axiom,
    ( some_monitors_are_not_awake
    | some_monitors_are_awake ),
    c13 ).

cnf(c_0_12,negated_conjecture,
    ~ some_monitors_are_awake,
    c_0_8 ).

cnf(c_0_13,plain,
    ( some_germans_play
    | ~ some_scotch_dance_not
    | ~ some_irish_fight_not ),
    c_0_9 ).

cnf(c_0_14,axiom,
    some_scotch_dance_not,
    c19 ).

cnf(c_0_15,plain,
    ( some_irish_fight_not
    | ~ some_english_sing
    | ~ some_monitors_are_not_awake ),
    c_0_10 ).

cnf(c_0_16,axiom,
    some_english_sing,
    c18 ).

cnf(c_0_17,plain,
    some_monitors_are_not_awake,
    inference(sr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( some_monitors_are_awake
    | ~ some_english_sing
    | ~ some_english_sing_not ),
    inference(fof_simplification,[status(thm)],[c1]) ).

cnf(c_0_19,plain,
    ( some_english_sing_not
    | ~ some_english_sing
    | ~ some_scotch_dance_not
    | ~ some_germans_play ),
    inference(fof_simplification,[status(thm)],[c9]) ).

cnf(c_0_20,plain,
    ( some_germans_play
    | ~ some_irish_fight_not ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_21,plain,
    some_irish_fight_not,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_22,plain,
    ( some_monitors_are_awake
    | ~ some_english_sing
    | ~ some_english_sing_not ),
    c_0_18 ).

cnf(c_0_23,plain,
    ( some_english_sing_not
    | ~ some_english_sing
    | ~ some_scotch_dance_not
    | ~ some_germans_play ),
    c_0_19 ).

cnf(c_0_24,plain,
    some_germans_play,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_25,plain,
    ~ some_english_sing_not,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16])]),c_0_12]) ).

cnf(c_0_26,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16]),c_0_24]),c_0_14])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13  % Problem    : PUZ013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n023.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Fri May  3 11:23:38 EDT 2024
% 0.14/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.5curHBw0w2/E---3.1_3059.p
% 0.22/0.52  # Version: 3.1.0
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 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  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3189 completed with status 0
% 0.22/0.52  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 811s (1) cores
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 151s (1) cores
% 0.22/0.52  # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52  # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52  # Starting sh5l with 136s (1) cores
% 0.22/0.52  # G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 3196 completed with status 0
% 0.22/0.52  # Result found by G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.22/0.52  # Preprocessing class: FSMSSLSSSSSNFFN.
% 0.22/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.22/0.52  # No SInE strategy applied
% 0.22/0.52  # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.22/0.52  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52  # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 811s (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                        : 20
% 0.22/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.52  # Initial clauses                      : 20
% 0.22/0.52  # Removed in clause preprocessing      : 0
% 0.22/0.52  # Initial clauses in saturation        : 20
% 0.22/0.52  # Processed clauses                    : 21
% 0.22/0.52  # ...of these trivial                  : 2
% 0.22/0.52  # ...subsumed                          : 3
% 0.22/0.52  # ...remaining for further processing  : 15
% 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                   : 3
% 0.22/0.52  # Generated clauses                    : 0
% 0.22/0.52  # ...of the previous two non-redundant : 2
% 0.22/0.52  # ...aggressively subsumed             : 0
% 0.22/0.52  # Contextual simplify-reflections      : 1
% 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                  : 13
% 0.22/0.52  # ...of those cached                   : 8
% 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  : 11
% 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             : 2
% 0.22/0.52  #    Non-unit-clauses                  : 4
% 0.22/0.52  # Current number of unprocessed clauses: 1
% 0.22/0.52  # ...number of literals in the above   : 2
% 0.22/0.52  # Current number of archived formulas  : 0
% 0.22/0.52  # Current number of archived clauses   : 4
% 0.22/0.52  # Clause-clause subsumption calls (NU) : 3
% 0.22/0.52  # Rec. Clause-clause subsumption calls : 2
% 0.22/0.52  # Non-unit clause-clause subsumptions  : 1
% 0.22/0.52  # Unit Clause-clause subsumption calls : 4
% 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          : 370
% 0.22/0.52  # Search garbage collected termcells   : 34
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.001 s
% 0.22/0.52  # System time              : 0.003 s
% 0.22/0.52  # Total time               : 0.005 s
% 0.22/0.52  # Maximum resident set size: 1668 pages
% 0.22/0.52  
% 0.22/0.52  # -------------------------------------------------
% 0.22/0.52  # User time                : 0.007 s
% 0.22/0.52  # System time              : 0.008 s
% 0.22/0.52  # Total time               : 0.015 s
% 0.22/0.52  # Maximum resident set size: 1688 pages
% 0.22/0.52  % E---3.1 exiting
% 0.22/0.52  % E exiting
%------------------------------------------------------------------------------