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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : PUZ019-1 : TPTP v8.2.0. Bugfixed v5.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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:41 EDT 2024

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   33 (  11 unt;   4 nHn;  31 RR)
%            Number of literals    :   94 (   0 equ;  71 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :   63 (  52 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(males_are_not_female,axiom,
    ( ~ male(X1)
    | ~ female(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',males_are_not_female) ).

cnf(find_who_has_each_job,negated_conjecture,
    ( ~ has_job(X1,chef)
    | ~ has_job(X2,guard)
    | ~ has_job(X3,nurse)
    | ~ has_job(X4,operator)
    | ~ has_job(X5,police)
    | ~ has_job(X6,teacher)
    | ~ has_job(X7,actor)
    | ~ has_job(X8,boxer) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_who_has_each_job) ).

cnf(roberta_is_not_boxer,hypothesis,
    ~ has_job(roberta,boxer),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',roberta_is_not_boxer) ).

cnf(actor_is_male,axiom,
    ( male(X1)
    | ~ has_job(X1,actor) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',actor_is_male) ).

cnf(thelma_is_female,hypothesis,
    female(thelma),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thelma_is_female) ).

cnf(every_job_is_used,hypothesis,
    ( has_job(roberta,X1)
    | has_job(thelma,X1)
    | has_job(pete,X1)
    | has_job(steve,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',every_job_is_used) ).

cnf(roberta_is_not_police,hypothesis,
    ~ has_job(roberta,police),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',roberta_is_not_police) ).

cnf(nurse_is_male,axiom,
    ( male(X1)
    | ~ has_job(X1,nurse) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nurse_is_male) ).

cnf(c_0_8,plain,
    ( ~ male(X1)
    | ~ female(X1) ),
    inference(fof_simplification,[status(thm)],[males_are_not_female]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ has_job(X1,chef)
    | ~ has_job(X2,guard)
    | ~ has_job(X3,nurse)
    | ~ has_job(X4,operator)
    | ~ has_job(X5,police)
    | ~ has_job(X6,teacher)
    | ~ has_job(X7,actor)
    | ~ has_job(X8,boxer) ),
    inference(fof_simplification,[status(thm)],[find_who_has_each_job]) ).

cnf(c_0_10,hypothesis,
    ~ has_job(roberta,boxer),
    inference(fof_simplification,[status(thm)],[roberta_is_not_boxer]) ).

cnf(c_0_11,plain,
    ( male(X1)
    | ~ has_job(X1,actor) ),
    inference(fof_simplification,[status(thm)],[actor_is_male]) ).

cnf(c_0_12,plain,
    ( ~ male(X1)
    | ~ female(X1) ),
    c_0_8 ).

cnf(c_0_13,hypothesis,
    female(thelma),
    thelma_is_female ).

cnf(c_0_14,negated_conjecture,
    ( ~ has_job(X1,chef)
    | ~ has_job(X2,guard)
    | ~ has_job(X3,nurse)
    | ~ has_job(X4,operator)
    | ~ has_job(X5,police)
    | ~ has_job(X6,teacher)
    | ~ has_job(X7,actor)
    | ~ has_job(X8,boxer) ),
    c_0_9 ).

cnf(c_0_15,hypothesis,
    ( has_job(roberta,X1)
    | has_job(thelma,X1)
    | has_job(pete,X1)
    | has_job(steve,X1) ),
    every_job_is_used ).

cnf(c_0_16,hypothesis,
    ~ has_job(roberta,boxer),
    c_0_10 ).

cnf(c_0_17,plain,
    ( male(X1)
    | ~ has_job(X1,actor) ),
    c_0_11 ).

cnf(c_0_18,hypothesis,
    ~ male(thelma),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,hypothesis,
    ( ~ has_job(X1,actor)
    | ~ has_job(X2,teacher)
    | ~ has_job(X3,police)
    | ~ has_job(X4,operator)
    | ~ has_job(X5,nurse)
    | ~ has_job(X6,guard)
    | ~ has_job(X7,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_14]),c_0_14]) ).

cnf(c_0_20,hypothesis,
    ( has_job(steve,actor)
    | has_job(pete,actor)
    | has_job(roberta,actor) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18]) ).

cnf(c_0_21,hypothesis,
    ( ~ has_job(X1,teacher)
    | ~ has_job(X2,police)
    | ~ has_job(X3,operator)
    | ~ has_job(X4,nurse)
    | ~ has_job(X5,guard)
    | ~ has_job(X6,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]),c_0_19]) ).

cnf(c_0_22,hypothesis,
    ~ has_job(roberta,police),
    inference(fof_simplification,[status(thm)],[roberta_is_not_police]) ).

cnf(c_0_23,hypothesis,
    ( ~ has_job(X1,police)
    | ~ has_job(X2,operator)
    | ~ has_job(X3,nurse)
    | ~ has_job(X4,guard)
    | ~ has_job(X5,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_21]),c_0_21]),c_0_21]) ).

cnf(c_0_24,hypothesis,
    ~ has_job(roberta,police),
    c_0_22 ).

cnf(c_0_25,plain,
    ( male(X1)
    | ~ has_job(X1,nurse) ),
    inference(fof_simplification,[status(thm)],[nurse_is_male]) ).

cnf(c_0_26,hypothesis,
    ( ~ has_job(X1,operator)
    | ~ has_job(X2,nurse)
    | ~ has_job(X3,guard)
    | ~ has_job(X4,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),c_0_23]),c_0_23]) ).

cnf(c_0_27,plain,
    ( male(X1)
    | ~ has_job(X1,nurse) ),
    c_0_25 ).

cnf(c_0_28,hypothesis,
    ( ~ has_job(X1,nurse)
    | ~ has_job(X2,guard)
    | ~ has_job(X3,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_26]),c_0_26]),c_0_26]) ).

cnf(c_0_29,hypothesis,
    ( has_job(steve,nurse)
    | has_job(pete,nurse)
    | has_job(roberta,nurse) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_18]) ).

cnf(c_0_30,hypothesis,
    ( ~ has_job(X1,guard)
    | ~ has_job(X2,chef) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]),c_0_28]) ).

cnf(c_0_31,hypothesis,
    ~ has_job(X1,chef),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_30]),c_0_30]),c_0_30]) ).

cnf(c_0_32,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_31]),c_0_31]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : PUZ019-1 : TPTP v8.2.0. Bugfixed v5.1.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n022.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sat May 18 10:43:52 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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/benchmark/theBenchmark.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI 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  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 8030 completed with status 0
% 0.19/0.48  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.19/0.48  # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.19/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.48  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48  # Starting sh5l with 136s (1) cores
% 0.19/0.48  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 8035 completed with status 0
% 0.19/0.48  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.48  # No SInE strategy applied
% 0.19/0.48  # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.19/0.48  # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.19/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.19/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.002 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 64
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.48  # Initial clauses                      : 64
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 64
% 0.19/0.48  # Processed clauses                    : 162
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 6
% 0.19/0.48  # ...remaining for further processing  : 156
% 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                    : 15
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 72
% 0.19/0.48  # ...of the previous two non-redundant : 57
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 17
% 0.19/0.48  # Paramodulations                      : 67
% 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                  : 13
% 0.19/0.48  # ...of those cached                   : 7
% 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  : 72
% 0.19/0.48  #    Positive orientable unit clauses  : 6
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 40
% 0.19/0.48  #    Non-unit-clauses                  : 26
% 0.19/0.48  # Current number of unprocessed clauses: 17
% 0.19/0.48  # ...number of literals in the above   : 126
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 84
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 1251
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 229
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 30
% 0.19/0.48  # Unit Clause-clause subsumption calls : 162
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 30
% 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          : 2544
% 0.19/0.48  # Search garbage collected termcells   : 139
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.008 s
% 0.19/0.48  # System time              : 0.004 s
% 0.19/0.48  # Total time               : 0.012 s
% 0.19/0.48  # Maximum resident set size: 1760 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.047 s
% 0.19/0.48  # System time              : 0.009 s
% 0.19/0.48  # Total time               : 0.056 s
% 0.19/0.48  # Maximum resident set size: 1756 pages
% 0.19/0.48  % E---3.1 exiting
% 0.19/0.48  % E exiting
%------------------------------------------------------------------------------