↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN223-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p 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 : Fri Sep 25 03:39:28 PM UTC 2026

% Result   : Unsatisfiable 2.38s 1.14s
% Output   : CNFRefutation 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  10 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   43 (  23   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    n0(d,b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_7) ).

fof(f9,axiom,
    r0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

fof(f31,axiom,
    m0(b,b,e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).

fof(f39,axiom,
    ! [X0,X1] :
      ( ~ n0(X1,X0)
      | k1(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).

fof(f78,axiom,
    ! [X0,X1] :
      ( ~ k1(X0)
      | ~ m0(X0,X1,e)
      | n1(X0,e,e) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_040) ).

fof(f208,axiom,
    ! [X0] :
      ( ~ n1(X0,e,e)
      | p2(X0,e,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_170) ).

fof(f253,axiom,
    ! [X0,X1] :
      ( ~ p2(X0,X1,X0)
      | ~ r0(X0)
      | l3(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_215) ).

fof(f369,negated_conjecture,
    ! [X0] : ~ l3(X0,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tcf(c_418,negated_conjecture,
    ! [X0: $i] : ~ l3(X0,e),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_420,plain,
    ! [X0: $i] :
      ( p2(X0,e,X0)
      | ~ n1(X0,e,e) ),
    inference(cnf_transformation,[],[f208]) ).

tcf(c_427,plain,
    m0(b,b,e),
    inference(cnf_transformation,[],[f31]) ).

tcf(c_444,plain,
    ! [X0: $i,X1: $i] :
      ( l3(X0,X1)
      | ~ r0(X0)
      | ~ p2(X0,X1,X0) ),
    inference(cnf_transformation,[],[f253]) ).

tcf(c_573,plain,
    r0(b),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_690,plain,
    ! [X0: $i,X1: $i] :
      ( k1(X1)
      | ~ n0(X0,X1) ),
    inference(cnf_transformation,[],[f39]) ).

tcf(c_697,plain,
    n0(d,b),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_704,plain,
    ! [X0: $i,X1: $i] :
      ( n1(X0,e,e)
      | ~ k1(X0)
      | ~ m0(X0,X1,e) ),
    inference(cnf_transformation,[],[f78]) ).

tcf(c_756,plain,
    ~ l3(b,e),
    inference(instantiation,[status(thm)],[c_418]) ).

tcf(c_814,plain,
    ( p2(b,e,b)
    | ~ n1(b,e,e) ),
    inference(instantiation,[status(thm)],[c_420]) ).

tcf(c_836,plain,
    ( n1(b,e,e)
    | ~ k1(b)
    | ~ m0(b,b,e) ),
    inference(instantiation,[status(thm)],[c_704]) ).

tcf(c_1204,plain,
    ! [X0: $i] :
      ( l3(X0,e)
      | ~ r0(X0)
      | ~ p2(X0,e,X0) ),
    inference(instantiation,[status(thm)],[c_444]) ).

tcf(c_1205,plain,
    ( l3(b,e)
    | ~ r0(b)
    | ~ p2(b,e,b) ),
    inference(instantiation,[status(thm)],[c_1204]) ).

tcf(c_1219,plain,
    ( k1(b)
    | ~ n0(d,b) ),
    inference(instantiation,[status(thm)],[c_690]) ).

tcf(c_1220,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1219,c_1205,c_836,c_814,c_427,c_756,c_697,c_573]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN223-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37  % Computer : n004.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 00:32:53 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41  Running EPR theorem proving
% 0.09/0.41  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.42  
% 0.09/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42  
% 0.09/0.42  % Detected problem language: tptp
% 0.09/0.43  % Proving...
% 2.38/1.14  % SZS status Started for theBenchmark.p
% 2.38/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.14  
% 2.38/1.14  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.38/1.14  
% 2.38/1.14  % ------  iProver source info
% 2.38/1.14  
% 2.38/1.14  % git: date: 2026-07-19 20:42:38 +0200
% 2.38/1.14  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.38/1.14  % git: non_committed_changes: false
% 2.38/1.14  
% 2.38/1.14  % ------ Parsing...% successful
% 2.38/1.14  
% 2.38/1.14  
% 2.38/1.14  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 2.38/1.14  % 
% 2.38/1.14  
% 2.38/1.14  % ------ Preprocessing... sf_s  rm: 87 0s  sf_e  sf_s  rm: 0 0s  sf_e % 
% 2.38/1.14  
% 2.38/1.14  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 2.38/1.14   gs_s  sp: 80 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.38/1.14  % ------ Proving...
% 2.38/1.14  % ------ Problem Properties 
% 2.38/1.14  
% 2.38/1.14  % 
% 2.38/1.14  % clauses                               300
% 2.38/1.14  % conjectures                           1
% 2.38/1.14  % EPR                                   300
% 2.38/1.14  % Horn                                  260
% 2.38/1.14  % unary                                 51
% 2.38/1.14  % binary                                128
% 2.38/1.14  % lits                                  713
% 2.38/1.14  % lits eq                               0
% 2.38/1.14  % fd_pure                               0
% 2.38/1.14  % fd_pseudo                             0
% 2.38/1.14  % fd_cond                               0
% 2.38/1.14  % fd_pseudo_cond                        0
% 2.38/1.14  % AC symbols                            0
% 2.38/1.14  
% 2.38/1.14  % ------ Schedule EPR non Horn non eq is on
% 2.38/1.14  
% 2.38/1.14  % ------ no equalities: superposition off 
% 2.38/1.14  
% 2.38/1.14  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.38/1.14  
% 2.38/1.14  
% 2.38/1.14  % ------ 
% 2.38/1.14  % Current options:
% 2.38/1.14  % ------ 
% 2.38/1.14  
% 2.38/1.14  
% 2.38/1.14  % 
% 2.38/1.14  
% 2.38/1.14  % ------ Proving...
% 2.38/1.14  % 
% 2.38/1.14  
% 2.38/1.14  % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.14  
% 2.38/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.14  
% 2.38/1.14  
%------------------------------------------------------------------------------