TSTP Solution File: LAT271-1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : LAT271-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 02:34:59 EDT 2024

% Result   : Unsatisfiable 25.50s 4.22s
% Output   : CNFRefutation 25.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :   10 (   0 equ;   5 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :    7 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_51,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) ).

cnf(c_55,negated_conjecture,
    c_in(v_x,v_S,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(c_56,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_7) ).

cnf(c_2797,plain,
    ( ~ c_lessequals(X0,c_Tarski_Ointerval(X1,X2,X3,X4),tc_set(X4))
    | ~ c_in(X5,X0,X4)
    | c_in(c_Pair(X2,X5,X4,X4),X1,tc_prod(X4,X4)) ),
    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_Ia1_M_Ax1_J_A_58_Ar_A_61_61_ATrue_0) ).

cnf(c_54840,plain,
    ( ~ c_in(X0,v_S,t_a)
    | c_in(c_Pair(v_a,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(superposition,[status(thm)],[c_51,c_2797]) ).

cnf(c_54965,plain,
    ~ c_in(v_x,v_S,t_a),
    inference(superposition,[status(thm)],[c_54840,c_56]) ).

cnf(c_54967,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_55,c_54965]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT271-1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Thu May  2 18:16:12 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 25.50/4.22  % SZS status Started for theBenchmark.p
% 25.50/4.22  % SZS status Unsatisfiable for theBenchmark.p
% 25.50/4.22  
% 25.50/4.22  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 25.50/4.22  
% 25.50/4.22  ------  iProver source info
% 25.50/4.22  
% 25.50/4.22  git: date: 2024-05-02 19:28:25 +0000
% 25.50/4.22  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 25.50/4.22  git: non_committed_changes: false
% 25.50/4.22  
% 25.50/4.22  ------ Parsing...successful
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  ------ Preprocessing... sup_sim: 107  sf_s  rm: 605 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e 
% 25.50/4.22  
% 25.50/4.22  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 25.50/4.22  
% 25.50/4.22  ------ Preprocessing... sf_s  rm: 1 0s  sf_e 
% 25.50/4.22  ------ Proving...
% 25.50/4.22  ------ Problem Properties 
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  clauses                                 1656
% 25.50/4.22  conjectures                             7
% 25.50/4.22  EPR                                     261
% 25.50/4.22  Horn                                    1472
% 25.50/4.22  unary                                   542
% 25.50/4.22  binary                                  688
% 25.50/4.22  lits                                    3424
% 25.50/4.22  lits eq                                 1071
% 25.50/4.22  fd_pure                                 0
% 25.50/4.22  fd_pseudo                               0
% 25.50/4.22  fd_cond                                 101
% 25.50/4.22  fd_pseudo_cond                          65
% 25.50/4.22  AC symbols                              0
% 25.50/4.22  
% 25.50/4.22  ------ Input Options Time Limit: Unbounded
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  ------ 
% 25.50/4.22  Current options:
% 25.50/4.22  ------ 
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  ------ Proving...
% 25.50/4.22  
% 25.50/4.22  
% 25.50/4.22  % SZS status Unsatisfiable for theBenchmark.p
% 25.50/4.22  
% 25.50/4.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 25.50/4.22  
% 25.50/4.22  
%------------------------------------------------------------------------------