↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PUZ002-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:01:20 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.42s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   44 (   7 unt;   2 nHn;  42 RR)
%            Number of literals    :   81 (   0 equ;  46 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   37 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(mouse_killers_are_carnivores,axiom,
    ( ~ mouse_killer(X1)
    | carnivore(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mouse_killers_are_carnivores) ).

cnf(cats_are_mice_killers,axiom,
    ( ~ cat(X1)
    | mouse_killer(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cats_are_mice_killers) ).

cnf(carnivores_are_prowlers,axiom,
    ( ~ carnivore(X1)
    | prowler(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',carnivores_are_prowlers) ).

cnf(kangaroos_are_not_pets,axiom,
    ( ~ suitable_pet(X1)
    | ~ kangaroo(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kangaroos_are_not_pets) ).

cnf(gazers_are_suitable_pets,axiom,
    ( ~ gazer(X1)
    | suitable_pet(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gazers_are_suitable_pets) ).

cnf(prowlers_are_gazers,axiom,
    ( ~ prowler(X1)
    | gazer(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prowlers_are_gazers) ).

cnf(only_cats_in_house,axiom,
    ( ~ in_house(X1)
    | cat(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_cats_in_house) ).

cnf(in_house_if_takes_to_me,axiom,
    ( ~ takes_to_me(X1)
    | in_house(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_house_if_takes_to_me) ).

cnf(avoid_kangaroo,negated_conjecture,
    ~ avoided(the_kangaroo),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',avoid_kangaroo) ).

cnf(avoid_detested,axiom,
    ( ~ detested(X1)
    | avoided(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',avoid_detested) ).

cnf(takes_to_me_or_detested,axiom,
    ( detested(X1)
    | takes_to_me(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',takes_to_me_or_detested) ).

cnf(kangaroo_is_a_kangaroo,axiom,
    kangaroo(the_kangaroo),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kangaroo_is_a_kangaroo) ).

cnf(c_0_12,plain,
    ( ~ mouse_killer(X1)
    | carnivore(X1) ),
    inference(fof_simplification,[status(thm)],[mouse_killers_are_carnivores]) ).

cnf(c_0_13,plain,
    ( ~ cat(X1)
    | mouse_killer(X1) ),
    inference(fof_simplification,[status(thm)],[cats_are_mice_killers]) ).

cnf(c_0_14,plain,
    ( ~ carnivore(X1)
    | prowler(X1) ),
    inference(fof_simplification,[status(thm)],[carnivores_are_prowlers]) ).

cnf(c_0_15,plain,
    ( ~ mouse_killer(X1)
    | carnivore(X1) ),
    c_0_12 ).

cnf(c_0_16,plain,
    ( ~ cat(X1)
    | mouse_killer(X1) ),
    c_0_13 ).

cnf(c_0_17,plain,
    ( ~ suitable_pet(X1)
    | ~ kangaroo(X1) ),
    inference(fof_simplification,[status(thm)],[kangaroos_are_not_pets]) ).

cnf(c_0_18,plain,
    ( ~ gazer(X1)
    | suitable_pet(X1) ),
    inference(fof_simplification,[status(thm)],[gazers_are_suitable_pets]) ).

cnf(c_0_19,plain,
    ( ~ prowler(X1)
    | gazer(X1) ),
    inference(fof_simplification,[status(thm)],[prowlers_are_gazers]) ).

cnf(c_0_20,plain,
    ( ~ carnivore(X1)
    | prowler(X1) ),
    c_0_14 ).

cnf(c_0_21,plain,
    ( ~ cat(X1)
    | carnivore(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,plain,
    ( ~ suitable_pet(X1)
    | ~ kangaroo(X1) ),
    c_0_17 ).

cnf(c_0_23,plain,
    ( ~ gazer(X1)
    | suitable_pet(X1) ),
    c_0_18 ).

cnf(c_0_24,plain,
    ( ~ prowler(X1)
    | gazer(X1) ),
    c_0_19 ).

cnf(c_0_25,plain,
    ( ~ cat(X1)
    | prowler(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    ( ~ gazer(X1)
    | ~ kangaroo(X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( ~ cat(X1)
    | gazer(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,plain,
    ( ~ in_house(X1)
    | cat(X1) ),
    inference(fof_simplification,[status(thm)],[only_cats_in_house]) ).

cnf(c_0_29,plain,
    ( ~ cat(X1)
    | ~ kangaroo(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    ( ~ in_house(X1)
    | cat(X1) ),
    c_0_28 ).

cnf(c_0_31,plain,
    ( ~ takes_to_me(X1)
    | in_house(X1) ),
    inference(fof_simplification,[status(thm)],[in_house_if_takes_to_me]) ).

cnf(c_0_32,negated_conjecture,
    ~ avoided(the_kangaroo),
    inference(fof_simplification,[status(thm)],[avoid_kangaroo]) ).

cnf(c_0_33,plain,
    ( ~ detested(X1)
    | avoided(X1) ),
    inference(fof_simplification,[status(thm)],[avoid_detested]) ).

cnf(c_0_34,plain,
    ( ~ in_house(X1)
    | ~ kangaroo(X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,plain,
    ( ~ takes_to_me(X1)
    | in_house(X1) ),
    c_0_31 ).

cnf(c_0_36,negated_conjecture,
    ~ avoided(the_kangaroo),
    c_0_32 ).

cnf(c_0_37,plain,
    ( ~ detested(X1)
    | avoided(X1) ),
    c_0_33 ).

cnf(c_0_38,plain,
    ( ~ takes_to_me(X1)
    | ~ kangaroo(X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,axiom,
    ( detested(X1)
    | takes_to_me(X1) ),
    takes_to_me_or_detested ).

cnf(c_0_40,negated_conjecture,
    ~ detested(the_kangaroo),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,plain,
    ( ~ kangaroo(X1)
    | detested(X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_42,axiom,
    kangaroo(the_kangaroo),
    kangaroo_is_a_kangaroo ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n016.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Mon Sep 21 03:49:38 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.42  % Version: 3.5.1
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42  % Starting sh5l with 300s (1) cores
% 0.14/0.42  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1480906 completed with status 0
% 0.14/0.42  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42  % No SInE strategy applied
% 0.14/0.42  % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42  % new_bool_1 with pid 1480915 completed with status 0
% 0.14/0.42  % Result found by new_bool_1
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42  % No SInE strategy applied
% 0.14/0.42  % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.42  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42  % Preprocessing time       : 0.001 s
% 0.14/0.42  % Presaturation interreduction done
% 0.14/0.42  
% 0.14/0.42  % Proof found!
% 0.14/0.42  % SZS status Unsatisfiable
% 0.14/0.42  % SZS output start CNFRefutation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 12
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 12
% 0.14/0.43  % Removed in clause preprocessing      : 0
% 0.14/0.43  % Initial clauses in saturation        : 12
% 0.14/0.43  % Processed clauses                    : 33
% 0.14/0.43  % ...of these trivial                  : 0
% 0.14/0.43  % ...subsumed                          : 0
% 0.14/0.43  % ...remaining for further processing  : 33
% 0.14/0.43  % Other redundant clauses eliminated   : 0
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 0
% 0.14/0.43  % Backward-rewritten                   : 0
% 0.14/0.43  % Generated clauses                    : 10
% 0.14/0.43  % ...of the previous two non-redundant : 9
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 0
% 0.14/0.43  % Paramodulations                      : 10
% 0.14/0.43  % Factorizations                       : 0
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 0
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 1
% 0.14/0.43  % ...of those cached                   : 0
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 21
% 0.14/0.43  %    Positive orientable unit clauses  : 1
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 2
% 0.14/0.43  %    Non-unit-clauses                  : 18
% 0.14/0.43  % Current number of unprocessed clauses: 0
% 0.14/0.43  % ...number of literals in the above   : 0
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 12
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 55
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 55
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.43  % Unit Clause-clause subsumption calls : 1
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 0
% 0.14/0.43  % BW rewrite match successes           : 0
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 411
% 0.14/0.43  % Search garbage collected termcells   : 22
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.001 s
% 0.14/0.43  % System time              : 0.003 s
% 0.14/0.43  % Total time               : 0.004 s
% 0.14/0.43  % Maximum resident set size: 3632 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.010 s
% 0.14/0.43  % System time              : 0.010 s
% 0.14/0.43  % Total time               : 0.020 s
% 0.14/0.43  % Maximum resident set size: 4608 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------