↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR004+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.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 12:15:52 PM UTC 2026

% Result   : Theorem 0.13s 0.43s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   48 (  15 equ)
%            Maximal formula atoms :   25 (   3 avg)
%            Number of connectives :   54 (  20   ~;  23   |;  10   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :    7 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(overflow_3,conjecture,
    happens(overflow,n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',overflow_3) ).

fof(happens_all_defn,axiom,
    ! [X4,X5] :
      ( happens(X4,X5)
    <=> ( ( X4 = overflow
          & holdsAt(filling,X5)
          & holdsAt(waterLevel(n3),X5) )
        | ( X5 = n0
          & X4 = tapOn ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

fof(waterLevel_3,lemma,
    holdsAt(waterLevel(n3),n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_3) ).

fof(filling_3,lemma,
    holdsAt(filling,n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',filling_3) ).

fof(c_0_4,negated_conjecture,
    ~ happens(overflow,n3),
    inference(assume_negation,[status(cth)],[overflow_3]) ).

fof(c_0_5,negated_conjecture,
    ~ happens(overflow,n3),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X42,X43] :
      ( ( happens(X42,X43)
        | X42 != overflow
        | ~ holdsAt(filling,X43)
        | ~ holdsAt(waterLevel(n3),X43) )
      & ( happens(X42,X43)
        | X43 != n0
        | X42 != tapOn )
      & ( ~ happens(X42,X43)
        | X43 = n0
        | X42 = overflow )
      & ( ~ happens(X42,X43)
        | X43 = n0
        | holdsAt(filling,X43) )
      & ( ~ happens(X42,X43)
        | X43 = n0
        | holdsAt(waterLevel(n3),X43) )
      & ( ~ happens(X42,X43)
        | X42 = tapOn
        | X42 = overflow )
      & ( ~ happens(X42,X43)
        | X42 = tapOn
        | holdsAt(filling,X43) )
      & ( ~ happens(X42,X43)
        | X42 = tapOn
        | holdsAt(waterLevel(n3),X43) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])]) ).

fof(c_0_7,negated_conjecture,
    ~ happens(overflow,n3),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( X2 != overflow
    | ~ holdsAt(filling,X1)
    | ~ holdsAt(waterLevel(n3),X1)
    | happens(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ happens(overflow,n3),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( ~ holdsAt(filling,X1)
    | ~ holdsAt(waterLevel(n3),X1)
    | happens(overflow,X1) ),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_11,lemma,
    holdsAt(waterLevel(n3),n3),
    inference(split_conjunct,[status(thm)],[waterLevel_3]) ).

cnf(c_0_12,lemma,
    holdsAt(filling,n3),
    inference(split_conjunct,[status(thm)],[filling_3]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR004+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n004.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 14:23:34 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.43  % Version: 3.5.1
% 0.13/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43  % Starting sh5l with 300s (1) cores
% 0.13/0.43  % new_bool_3 with pid 3367728 completed with status 0
% 0.13/0.43  % Result found by new_bool_3
% 0.13/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.43  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43  % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43  % SubtermCWHack with pid 3367733 completed with status 0
% 0.13/0.43  % Result found by SubtermCWHack
% 0.13/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.43  % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.43  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43  % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.43  % Preprocessing time       : 0.001 s
% 0.13/0.43  
% 0.13/0.43  % Proof found!
% 0.13/0.43  % SZS status Theorem
% 0.13/0.43  % SZS output start CNFRefutation
% See solution above
% 0.13/0.43  % Parsed axioms                        : 57
% 0.13/0.43  % Removed by relevancy pruning/SinE    : 18
% 0.13/0.43  % Initial clauses                      : 104
% 0.13/0.43  % Removed in clause preprocessing      : 1
% 0.13/0.43  % Initial clauses in saturation        : 103
% 0.13/0.43  % Processed clauses                    : 126
% 0.13/0.43  % ...of these trivial                  : 0
% 0.13/0.43  % ...subsumed                          : 43
% 0.13/0.43  % ...remaining for further processing  : 83
% 0.13/0.43  % Other redundant clauses eliminated   : 13
% 0.13/0.43  % Clauses deleted for lack of memory   : 0
% 0.13/0.43  % Backward-subsumed                    : 0
% 0.13/0.43  % Backward-rewritten                   : 1
% 0.13/0.43  % Generated clauses                    : 104
% 0.13/0.43  % ...of the previous two non-redundant : 75
% 0.13/0.43  % ...aggressively subsumed             : 0
% 0.13/0.43  % Contextual simplify-reflections      : 0
% 0.13/0.43  % Paramodulations                      : 93
% 0.13/0.43  % Factorizations                       : 2
% 0.13/0.43  % NegExts                              : 0
% 0.13/0.43  % Equation resolutions                 : 14
% 0.13/0.43  % Disequality decompositions           : 0
% 0.13/0.43  % Total rewrite steps                  : 15
% 0.13/0.43  % ...of those cached                   : 6
% 0.13/0.43  % Propositional unsat checks           : 0
% 0.13/0.43  %    Propositional check models        : 0
% 0.13/0.43  %    Propositional check unsatisfiable : 0
% 0.13/0.43  %    Propositional clauses             : 0
% 0.13/0.43  %    Propositional clauses after purity: 0
% 0.13/0.43  %    Propositional unsat core size     : 0
% 0.13/0.43  %    Propositional preprocessing time  : 0.000
% 0.13/0.43  %    Propositional encoding time       : 0.000
% 0.13/0.43  %    Propositional solver time         : 0.000
% 0.13/0.43  %    Success case prop preproc time    : 0.000
% 0.13/0.43  %    Success case prop encoding time   : 0.000
% 0.13/0.43  %    Success case prop solver time     : 0.000
% 0.13/0.43  % Current number of processed clauses  : 74
% 0.13/0.43  %    Positive orientable unit clauses  : 19
% 0.13/0.43  %    Positive unorientable unit clauses: 1
% 0.13/0.43  %    Negative unit clauses             : 17
% 0.13/0.43  %    Non-unit-clauses                  : 37
% 0.13/0.43  % Current number of unprocessed clauses: 52
% 0.13/0.43  % ...number of literals in the above   : 232
% 0.13/0.43  % Current number of archived formulas  : 0
% 0.13/0.43  % Current number of archived clauses   : 1
% 0.13/0.43  % Clause-clause subsumption calls (NU) : 224
% 0.13/0.43  % Rec. Clause-clause subsumption calls : 212
% 0.13/0.43  % Non-unit clause-clause subsumptions  : 21
% 0.13/0.43  % Unit Clause-clause subsumption calls : 35
% 0.13/0.43  % Rewrite failures with RHS unbound    : 0
% 0.13/0.43  % BW rewrite match attempts            : 12
% 0.13/0.43  % BW rewrite match successes           : 12
% 0.13/0.43  % Condensation attempts                : 0
% 0.13/0.43  % Condensation successes               : 0
% 0.13/0.43  % Termbank termtop insertions          : 5576
% 0.13/0.43  % Search garbage collected termcells   : 1057
% 0.13/0.43  
% 0.13/0.43  % -------------------------------------------------
% 0.13/0.43  % User time                : 0.009 s
% 0.13/0.43  % System time              : 0.003 s
% 0.13/0.43  % Total time               : 0.011 s
% 0.13/0.43  % Maximum resident set size: 3948 pages
% 0.13/0.43  
% 0.13/0.43  % -------------------------------------------------
% 0.13/0.43  % User time                : 0.010 s
% 0.13/0.43  % System time              : 0.010 s
% 0.13/0.43  % Total time               : 0.019 s
% 0.13/0.43  % Maximum resident set size: 4608 pages
% 0.13/0.43  % E exiting
%------------------------------------------------------------------------------