↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : TIM031_1 : TPTP v9.3.1. Released v9.3.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 03:53:18 PM UTC 2026

% Result   : Theorem 0.14s 0.61s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  25 unt;   0 typ;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  19   ~;  10   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   15 (   0 sgn  15   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    interval: $tType ).

tff(decl_23,type,
    before: ( interval * interval ) > $o ).

tff(decl_35,type,
    a: interval ).

tff(decl_36,type,
    b: interval ).

tff(decl_37,type,
    c: interval ).

tff(decl_38,type,
    d: interval ).

tff(decl_39,type,
    e: interval ).

tff(decl_40,type,
    f: interval ).

tff(decl_41,type,
    g: interval ).

tff(decl_42,type,
    h: interval ).

tff(goal,conjecture,
    before(a,h),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

tff(before_transitive,axiom,
    ! [X1: interval,X2: interval,X3: interval] :
      ( ( before(X2,X3)
        & before(X1,X2) )
     => before(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/TIM002_0.ax',before_transitive) ).

tff(p7,axiom,
    before(g,h),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7) ).

tff(p6,axiom,
    before(f,g),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6) ).

tff(p5,axiom,
    before(e,f),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5) ).

tff(p4,axiom,
    before(d,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4) ).

tff(p3,axiom,
    before(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3) ).

tff(p2,axiom,
    before(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).

tff(p1,axiom,
    before(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).

tff(c_0_9,negated_conjecture,
    ~ before(a,h),
    inference(assume_negation,[status(cth)],[goal]) ).

tff(c_0_10,negated_conjecture,
    ~ before(a,h),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

tff(c_0_11,plain,
    ! [X5: interval,X6: interval,X7: interval] :
      ( before(X5,X7)
      | ~ before(X6,X7)
      | ~ before(X5,X6) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[before_transitive])])]) ).

tff(c_0_12,negated_conjecture,
    ~ before(a,h),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

tcf(c_0_13,plain,
    ! [X1: interval,X2: interval,X3: interval] :
      ( ~ before(X2,X3)
      | ~ before(X1,X2)
      | before(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

tcf(c_0_14,plain,
    before(g,h),
    inference(split_conjunct,[status(thm)],[p7]) ).

tcf(c_0_15,negated_conjecture,
    ~ before(a,h),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_16,plain,
    ! [X1: interval] :
      ( ~ before(X1,g)
      | before(X1,h) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

tcf(c_0_17,plain,
    before(f,g),
    inference(split_conjunct,[status(thm)],[p6]) ).

tcf(c_0_18,negated_conjecture,
    ~ before(a,g),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

tcf(c_0_19,plain,
    ! [X1: interval] :
      ( ~ before(X1,f)
      | before(X1,g) ),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

tcf(c_0_20,plain,
    before(e,f),
    inference(split_conjunct,[status(thm)],[p5]) ).

tcf(c_0_21,negated_conjecture,
    ~ before(a,f),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

tcf(c_0_22,plain,
    ! [X1: interval] :
      ( ~ before(X1,e)
      | before(X1,f) ),
    inference(spm,[status(thm)],[c_0_13,c_0_20]) ).

tcf(c_0_23,plain,
    before(d,e),
    inference(split_conjunct,[status(thm)],[p4]) ).

tcf(c_0_24,negated_conjecture,
    ~ before(a,e),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

tcf(c_0_25,plain,
    ! [X1: interval] :
      ( ~ before(X1,d)
      | before(X1,e) ),
    inference(spm,[status(thm)],[c_0_13,c_0_23]) ).

tcf(c_0_26,plain,
    before(c,d),
    inference(split_conjunct,[status(thm)],[p3]) ).

tcf(c_0_27,negated_conjecture,
    ~ before(a,d),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

tcf(c_0_28,plain,
    ! [X1: interval] :
      ( ~ before(X1,c)
      | before(X1,d) ),
    inference(spm,[status(thm)],[c_0_13,c_0_26]) ).

tcf(c_0_29,plain,
    before(b,c),
    inference(split_conjunct,[status(thm)],[p2]) ).

tcf(c_0_30,negated_conjecture,
    ~ before(a,c),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

tcf(c_0_31,plain,
    ! [X1: interval] :
      ( ~ before(X1,b)
      | before(X1,c) ),
    inference(spm,[status(thm)],[c_0_13,c_0_29]) ).

tcf(c_0_32,plain,
    before(a,b),
    inference(split_conjunct,[status(thm)],[p1]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : TIM031_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.54  % Computer : n004.cluster.edu
% 0.11/0.54  % Model    : x86_64 x86_64
% 0.11/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54  % Memory   : 8046.5625MB
% 0.11/0.54  % OS       : Linux 6.8.0-71-generic
% 0.11/0.54  % CPULimit : 300
% 0.11/0.54  % WCLimit  : 300
% 0.11/0.54  % DateTime : Mon Sep 21 12:37:35 UTC 2026
% 0.11/0.54  % CPUTime  : 
% 0.11/0.54  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.59  Running first-order theorem proving
% 0.14/0.59  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.14/0.61  % Version: 3.5.1
% 0.14/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.61  % Starting sh5l with 300s (1) cores
% 0.14/0.61  % sh5l with pid 3131754 completed with status 0
% 0.14/0.61  % Result found by sh5l
% 0.14/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.61  % Starting sh5l with 300s (1) cores
% 0.14/0.61  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.61  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.61  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.14/0.61  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.61  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.61  % SubtermCWHack with pid 3131757 completed with status 0
% 0.14/0.61  % Result found by SubtermCWHack
% 0.14/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.61  % Starting sh5l with 300s (1) cores
% 0.14/0.61  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.61  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.61  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.14/0.61  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.61  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.61  % Preprocessing time       : 0.001 s
% 0.14/0.61  
% 0.14/0.61  % Proof found!
% 0.14/0.61  % SZS status Theorem
% 0.14/0.61  % SZS output start CNFRefutation
% See solution above
% 0.14/0.61  % Parsed axioms                        : 37
% 0.14/0.61  % Removed by relevancy pruning/SinE    : 27
% 0.14/0.61  % Initial clauses                      : 10
% 0.14/0.61  % Removed in clause preprocessing      : 0
% 0.14/0.61  % Initial clauses in saturation        : 10
% 0.14/0.61  % Processed clauses                    : 35
% 0.14/0.61  % ...of these trivial                  : 0
% 0.14/0.61  % ...subsumed                          : 0
% 0.14/0.61  % ...remaining for further processing  : 35
% 0.14/0.61  % Other redundant clauses eliminated   : 0
% 0.14/0.62  % Clauses deleted for lack of memory   : 0
% 0.14/0.62  % Backward-subsumed                    : 0
% 0.14/0.62  % Backward-rewritten                   : 0
% 0.14/0.62  % Generated clauses                    : 39
% 0.14/0.62  % ...of the previous two non-redundant : 38
% 0.14/0.62  % ...aggressively subsumed             : 0
% 0.14/0.62  % Contextual simplify-reflections      : 0
% 0.14/0.62  % Paramodulations                      : 39
% 0.14/0.62  % Factorizations                       : 0
% 0.14/0.62  % NegExts                              : 0
% 0.14/0.62  % Equation resolutions                 : 0
% 0.14/0.62  % Disequality decompositions           : 0
% 0.14/0.62  % Total rewrite steps                  : 1
% 0.14/0.62  % ...of those cached                   : 0
% 0.14/0.62  % Propositional unsat checks           : 0
% 0.14/0.62  %    Propositional check models        : 0
% 0.14/0.62  %    Propositional check unsatisfiable : 0
% 0.14/0.62  %    Propositional clauses             : 0
% 0.14/0.62  %    Propositional clauses after purity: 0
% 0.14/0.62  %    Propositional unsat core size     : 0
% 0.14/0.62  %    Propositional preprocessing time  : 0.000
% 0.14/0.62  %    Propositional encoding time       : 0.000
% 0.14/0.62  %    Propositional solver time         : 0.000
% 0.14/0.62  %    Success case prop preproc time    : 0.000
% 0.14/0.62  %    Success case prop encoding time   : 0.000
% 0.14/0.62  %    Success case prop solver time     : 0.000
% 0.14/0.62  % Current number of processed clauses  : 35
% 0.14/0.62  %    Positive orientable unit clauses  : 7
% 0.14/0.62  %    Positive unorientable unit clauses: 0
% 0.14/0.62  %    Negative unit clauses             : 21
% 0.14/0.62  %    Non-unit-clauses                  : 7
% 0.14/0.62  % Current number of unprocessed clauses: 13
% 0.14/0.62  % ...number of literals in the above   : 26
% 0.14/0.62  % Current number of archived formulas  : 0
% 0.14/0.62  % Current number of archived clauses   : 0
% 0.14/0.62  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.62  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.62  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.62  % Unit Clause-clause subsumption calls : 151
% 0.14/0.62  % Rewrite failures with RHS unbound    : 0
% 0.14/0.62  % BW rewrite match attempts            : 0
% 0.14/0.62  % BW rewrite match successes           : 0
% 0.14/0.62  % Condensation attempts                : 0
% 0.14/0.62  % Condensation successes               : 0
% 0.14/0.62  % Termbank termtop insertions          : 623
% 0.14/0.62  % Search garbage collected termcells   : 41
% 0.14/0.62  
% 0.14/0.62  % -------------------------------------------------
% 0.14/0.62  % User time                : 0.002 s
% 0.14/0.62  % System time              : 0.004 s
% 0.14/0.62  % Total time               : 0.006 s
% 0.14/0.62  % Maximum resident set size: 3648 pages
% 0.14/0.62  
% 0.14/0.62  % -------------------------------------------------
% 0.14/0.62  % User time                : 0.003 s
% 0.14/0.62  % System time              : 0.009 s
% 0.14/0.62  % Total time               : 0.013 s
% 0.14/0.62  % Maximum resident set size: 4608 pages
% 0.14/0.62  % E exiting
%------------------------------------------------------------------------------