↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n019.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 1.16s 11.14s
% Output   : CNFRefutation 1.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  10 unt;   0 def)
%            Number of atoms       :   42 (   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  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?;  10   :)

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

fof(f24,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).

fof(f32,axiom,
    k0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).

fof(f59,axiom,
    ! [X0,X1] :
      ( ~ k0(X1)
      | ~ l0(X0)
      | m1(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).

fof(f214,axiom,
    ! [X0,X1] :
      ( ~ m1(X1,X0,X1)
      | p2(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).

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

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

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

tcf(c_441,plain,
    l0(c),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_449,plain,
    k0(b),
    inference(cnf_transformation,[],[f32]) ).

tcf(c_476,plain,
    ! [X0: $i,X1: $i] :
      ( m1(X0,X1,X0)
      | ~ k0(X1)
      | ~ l0(X0) ),
    inference(cnf_transformation,[],[f59]) ).

tcf(c_628,plain,
    ! [X0: $i,X1: $i] :
      ( p2(X1,X0,X1)
      | ~ m1(X0,X1,X0) ),
    inference(cnf_transformation,[],[f214]) ).

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

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

tcf(c_771,plain,
    ~ l3(b,c),
    inference(instantiation,[status(thm)],[c_768]) ).

tcf(c_1231,plain,
    ! [X0: $i] :
      ( l3(X0,c)
      | ~ r0(X0)
      | ~ p2(X0,c,X0) ),
    inference(instantiation,[status(thm)],[c_665]) ).

tcf(c_1232,plain,
    ( l3(b,c)
    | ~ r0(b)
    | ~ p2(b,c,b) ),
    inference(instantiation,[status(thm)],[c_1231]) ).

tcf(c_1316,plain,
    ! [X0: $i] :
      ( m1(c,X0,c)
      | ~ l0(c)
      | ~ k0(X0) ),
    inference(instantiation,[status(thm)],[c_476]) ).

tcf(c_1317,plain,
    ( m1(c,b,c)
    | ~ k0(b)
    | ~ l0(c) ),
    inference(instantiation,[status(thm)],[c_1316]) ).

tcf(c_1606,plain,
    ! [X0: $i] :
      ( p2(X0,c,X0)
      | ~ m1(c,X0,c) ),
    inference(instantiation,[status(thm)],[c_628]) ).

tcf(c_1607,plain,
    ( p2(b,c,b)
    | ~ m1(c,b,c) ),
    inference(instantiation,[status(thm)],[c_1606]) ).

tcf(c_1608,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1607,c_1317,c_1232,c_771,c_426,c_441,c_449]) ).


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