↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : TIM035_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n012.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 : Fri Sep 25 03:54:35 PM UTC 2026

% Result   : Theorem 0.66s 1.06s
% Output   : CNFRefutation 0.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   8   ~;   3   |;   0   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    9 (   9 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  14 usr;   3 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    a: interval ).

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

tff(pred_def_2,type,
    after: ( interval * interval ) > $o ).

tff(pred_def_3,type,
    meets: ( interval * interval ) > $o ).

tff(pred_def_4,type,
    met_by: ( interval * interval ) > $o ).

tff(pred_def_5,type,
    overlaps: ( interval * interval ) > $o ).

tff(pred_def_6,type,
    overlapped_by: ( interval * interval ) > $o ).

tff(pred_def_7,type,
    starts: ( interval * interval ) > $o ).

tff(pred_def_8,type,
    started_by: ( interval * interval ) > $o ).

tff(pred_def_9,type,
    during: ( interval * interval ) > $o ).

tff(pred_def_10,type,
    contains: ( interval * interval ) > $o ).

tff(pred_def_11,type,
    finishes: ( interval * interval ) > $o ).

tff(pred_def_12,type,
    finished_by: ( interval * interval ) > $o ).

tff(f3,axiom,
    ! [X0: interval,X1: interval] :
      ( overlaps(X0,X1)
    <=> overlapped_by(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/TIM002_0.ax',overlaps_inverse) ).

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

tff(f12,conjecture,
    overlapped_by(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

tff(f13,negated_conjecture,
    ~ overlapped_by(b,a),
    inference(negated_conjecture,[status(cth)],[f12]) ).

tff(f14,plain,
    ~ overlapped_by(b,a),
    inference(flattening,[],[f13]) ).

tff(f15,plain,
    ! [X0: interval,X1: interval] :
      ( overlaps(X0,X1)
     => overlapped_by(X1,X0) ),
    inference(unused_predicate_definition_removal,[],[f3]) ).

tff(f16,plain,
    ! [X0: interval,X1: interval] :
      ( ~ overlaps(X0,X1)
      | overlapped_by(X1,X0) ),
    inference(ennf_transformation,[],[f15]) ).

tff(f22,plain,
    ! [X0: interval,X1: interval] :
      ( ~ overlaps(X0,X1)
      | overlapped_by(X1,X0) ),
    inference(cnf_transformation,[],[f16]) ).

tff(f25,plain,
    overlaps(a,b),
    inference(cnf_transformation,[],[f9]) ).

tff(f28,plain,
    ~ overlapped_by(b,a),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_51,plain,
    ! [X0_interval: interval,X1_interval: interval] :
      ( overlapped_by(X1_interval,X0_interval)
      | ~ overlaps(X0_interval,X1_interval) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_54,plain,
    overlaps(a,b),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_57,negated_conjecture,
    ~ overlapped_by(b,a),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_89,plain,
    ~ overlaps(a,b),
    inference(resolution,[status(thm)],[c_51,c_57]) ).

tcf(c_90,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_89,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : TIM035_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Fri Sep 25 04:06:51 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32  Running first-order theorem proving
% 0.04/0.32  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.33  
% 0.07/0.33  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33  
% 0.07/0.33  % Detected problem language: tptp
% 0.07/0.34  % Proving...
% 0.66/1.06  % SZS status Started for theBenchmark.p
% 0.66/1.06  % SZS status Theorem for theBenchmark.p
% 0.66/1.06  
% 0.66/1.06  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.66/1.06  
% 0.66/1.06  % ------  iProver source info
% 0.66/1.06  
% 0.66/1.06  % git: date: 2026-07-19 20:42:38 +0200
% 0.66/1.06  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.66/1.06  % git: non_committed_changes: false
% 0.66/1.06  
% 0.66/1.06  % ------ Parsing...
% 0.66/1.06  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.66/1.06  % 
% 0.66/1.06  
% 0.66/1.06  % ------ Preprocessing... pe_s % 
% 0.66/1.06  
% 0.66/1.06  % SZS status Theorem for theBenchmark.p
% 0.66/1.06  
% 0.66/1.06  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.66/1.06  
% 0.66/1.06  
%------------------------------------------------------------------------------