↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n026.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 01:58:31 PM UTC 2026

% Result   : Unsatisfiable 1.27s 1.75s
% Output   : CNFRefutation 1.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  11 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   56 (  28   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-4 aty)
%            Number of variables   :   33 (   0 sgn  33   !;   0   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( c_in(c_Pair(X0,X5,X2,X2),X3,tc_prod(X2,X2))
      | ~ c_lessequals(X1,c_Tarski_Ointerval(X3,X4,X5,X2),tc_set(X2))
      | ~ c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) ).

fof(f14,axiom,
    ! [X2,X0,X1] :
      ( c_in(v_sko__4mi(X0,v_r,X2),X0,t_a)
      | c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X2,v_A,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) ).

fof(f15,axiom,
    ! [X2,X0,X1] :
      ( c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(c_Pair(v_sko__4mi(X0,v_r,X2),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X2,v_A,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT006-2.ax',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) ).

fof(f3338,negated_conjecture,
    c_in(v_b,v_A,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f3339,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f3342,negated_conjecture,
    c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f3345,negated_conjecture,
    ~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

tcf(c_2812,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( c_in(c_Pair(X5,X3,X4,X4),X1,tc_prod(X4,X4))
      | ~ c_in(X5,X0,X4)
      | ~ c_lessequals(X0,c_Tarski_Ointerval(X1,X2,X3,X4),tc_set(X4)) ),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_2816,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_in(v_sko__4mi(X0,v_r,X2),X0,t_a)
      | c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X2,v_A,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a) ),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_2817,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X1,v_A,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X2,t_a)
      | ~ c_in(c_Pair(v_sko__4mi(X0,v_r,X1),X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_4963,negated_conjecture,
    c_in(v_b,v_A,t_a),
    inference(cnf_transformation,[],[f3338]) ).

tcf(c_4964,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    inference(cnf_transformation,[],[f3339]) ).

tcf(c_4966,negated_conjecture,
    c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    inference(cnf_transformation,[],[f3342]) ).

tcf(c_4968,negated_conjecture,
    ~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    inference(cnf_transformation,[],[f3345]) ).

tcf(c_5301,plain,
    ! [X0: $i] :
      ( c_in(c_Pair(X0,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X0,v_S,t_a) ),
    inference(superposition,[status(thm)],[c_4964,c_2812]) ).

tcf(c_5324,plain,
    ! [X0: $i] :
      ( c_in(v_sko__4mi(v_S,v_r,X0),v_S,t_a)
      | c_in(c_Pair(v_L,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X0,v_A,t_a) ),
    inference(superposition,[status(thm)],[c_4966,c_2816]) ).

tcf(c_5415,plain,
    ! [X0: $i,X1: $i] :
      ( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(v_b,v_A,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
      | ~ c_in(v_sko__4mi(X0,v_r,v_b),v_S,t_a) ),
    inference(superposition,[status(thm)],[c_5301,c_2817]) ).

tcf(c_5472,plain,
    ( c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a)
    | ~ c_in(v_b,v_A,t_a) ),
    inference(superposition,[status(thm)],[c_5324,c_4968]) ).

tcf(c_5651,plain,
    ! [X0: $i,X1: $i] :
      ( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(v_sko__4mi(X0,v_r,v_b),v_S,t_a)
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a) ),
    inference(global_subsumption_just,[status(thm)],[c_5415,c_4963,c_5415]) ).

tcf(c_5652,plain,
    ! [X0: $i,X1: $i] :
      ( c_in(c_Pair(X1,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
      | ~ c_in(v_sko__4mi(X0,v_r,v_b),v_S,t_a) ),
    inference(renaming,[status(thm)],[c_5651]) ).

tcf(c_5771,plain,
    c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a),
    inference(global_subsumption_just,[status(thm)],[c_5472,c_4963,c_5472]) ).

tcf(c_5774,plain,
    ! [X0: $i] :
      ( c_in(c_Pair(X0,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_Tarski_OisLub(v_S,v_cl,X0,t_a) ),
    inference(superposition,[status(thm)],[c_5771,c_5652]) ).

tcf(c_6298,plain,
    ~ c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    inference(superposition,[status(thm)],[c_5774,c_4968]) ).

tcf(c_6304,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_4966,c_6298]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT273-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Wed Sep 23 20:48:54 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  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.12/0.42  
% 0.12/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42  
% 0.12/0.42  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 1.27/1.75  % SZS status Started for theBenchmark.p
% 1.27/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.75  
% 1.27/1.75  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.27/1.75  
% 1.27/1.75  % ------  iProver source info
% 1.27/1.75  
% 1.27/1.75  % git: date: 2026-07-19 20:42:38 +0200
% 1.27/1.75  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.27/1.75  % git: non_committed_changes: false
% 1.27/1.75  
% 1.27/1.75  % ------ Parsing...% successful
% 1.27/1.75  
% 1.27/1.75  
% 1.27/1.75  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.27/1.75  % ------ Proving...
% 1.27/1.75  % ------ Problem Properties 
% 1.27/1.75  
% 1.27/1.75  % 
% 1.27/1.75  % clauses                               2162
% 1.27/1.75  % conjectures                           7
% 1.27/1.75  % EPR                                   670
% 1.27/1.75  % Horn                                  1970
% 1.27/1.75  % unary                                 625
% 1.27/1.75  % binary                                1083
% 1.27/1.75  % lits                                  4392
% 1.27/1.75  % lits eq                               1178
% 1.27/1.75  % fd_pure                               0
% 1.27/1.75  % fd_pseudo                             0
% 1.27/1.75  % fd_cond                               122
% 1.27/1.75  % fd_pseudo_cond                        69
% 1.27/1.75  % AC symbols                            0
% 1.27/1.75  
% 1.27/1.75  % ------ Input Options Time Limit: Unbounded
% 1.27/1.75  
% 1.27/1.75  
% 1.27/1.75  % ------ 
% 1.27/1.75  % Current options:
% 1.27/1.75  % ------ 
% 1.27/1.75  
% 1.27/1.75  
% 1.27/1.75  % 
% 1.27/1.75  
% 1.27/1.75  % ------ Proving...
% 1.27/1.75  % 
% 1.27/1.75  
% 1.27/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.75  
% 1.27/1.75  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.27/1.75  
% 1.27/1.75  
%------------------------------------------------------------------------------