↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN189-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 : n016.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:24 PM UTC 2026

% Result   : Unsatisfiable 2.63s 1.20s
% Output   : CNFRefutation 2.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  12 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   50 (  26   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   13 (   0 sgn  13   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    s0(d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

fof(f17,axiom,
    ! [X0] : q0(X0,d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

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

fof(f28,axiom,
    k0(e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

fof(f155,axiom,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_117) ).

fof(f162,axiom,
    ! [X0,X1] :
      ( ~ q1(d,X1,d)
      | ~ s0(d)
      | ~ q0(X0,X1)
      | r1(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).

fof(f226,axiom,
    ! [X0] :
      ( ~ l0(X0)
      | ~ r1(X0)
      | r2(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_188) ).

fof(f369,negated_conjecture,
    ~ r2(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tcf(c_418,negated_conjecture,
    ~ r2(c),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_445,plain,
    ! [X0: $i] :
      ( r2(X0)
      | ~ r1(X0)
      | ~ l0(X0) ),
    inference(cnf_transformation,[],[f226]) ).

tcf(c_593,plain,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    inference(cnf_transformation,[],[f155]) ).

tcf(c_605,plain,
    s0(d),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_618,plain,
    ! [X0: $i] : q0(X0,d),
    inference(cnf_transformation,[],[f17]) ).

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

tcf(c_673,plain,
    k0(e),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_682,plain,
    ! [X0: $i,X1: $i] :
      ( r1(X1)
      | ~ s0(d)
      | ~ q0(X1,X0)
      | ~ q1(d,X0,d) ),
    inference(cnf_transformation,[],[f162]) ).

tcf(c_996,plain,
    ! [X0: $i,X1: $i] :
      ( r1(X1)
      | ~ q1(d,X0,d)
      | ~ q0(X1,X0) ),
    inference(global_subsumption_just,[status(thm)],[c_682,c_605,c_682]) ).

tcf(c_997,plain,
    ! [X0: $i,X1: $i] :
      ( r1(X1)
      | ~ q0(X1,X0)
      | ~ q1(d,X0,d) ),
    inference(renaming,[status(thm)],[c_996]) ).

tcf(c_1141,plain,
    ! [X0: $i] :
      ( r1(X0)
      | ~ q0(X0,d)
      | ~ q1(d,d,d) ),
    inference(instantiation,[status(thm)],[c_997]) ).

tcf(c_1255,plain,
    ( r2(c)
    | ~ r1(c)
    | ~ l0(c) ),
    inference(instantiation,[status(thm)],[c_445]) ).

tcf(c_1309,plain,
    ( r1(c)
    | ~ q0(c,d)
    | ~ q1(d,d,d) ),
    inference(instantiation,[status(thm)],[c_1141]) ).

tcf(c_1318,plain,
    q0(c,d),
    inference(instantiation,[status(thm)],[c_618]) ).

tcf(c_1319,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1318,c_1309,c_1255,c_593,c_418,c_605,c_659,c_673]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN189-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.11/0.36  % Computer : n016.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep 25 00:31:43 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40  Running EPR theorem proving
% 0.14/0.40  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.14/0.41  
% 0.14/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41  
% 0.14/0.41  % Detected problem language: tptp
% 0.14/0.43  % Proving...
% 2.63/1.20  % SZS status Started for theBenchmark.p
% 2.63/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.20  
% 2.63/1.20  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.63/1.20  
% 2.63/1.20  % ------  iProver source info
% 2.63/1.20  
% 2.63/1.20  % git: date: 2026-07-19 20:42:38 +0200
% 2.63/1.20  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.63/1.20  % git: non_committed_changes: false
% 2.63/1.20  
% 2.63/1.20  % ------ Parsing...% successful
% 2.63/1.20  
% 2.63/1.20  
% 2.63/1.20  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 2.63/1.20  % 
% 2.63/1.20  
% 2.63/1.20  % ------ Preprocessing... sf_s  rm: 178 0s  sf_e  sf_s  rm: 0 0s  sf_e % 
% 2.63/1.20  
% 2.63/1.20  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 2.63/1.20   gs_s  sp: 40 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.63/1.20  % ------ Proving...
% 2.63/1.20  % ------ Problem Properties 
% 2.63/1.20  
% 2.63/1.20  % 
% 2.63/1.20  % clauses                               170
% 2.63/1.20  % conjectures                           1
% 2.63/1.20  % EPR                                   170
% 2.63/1.20  % Horn                                  150
% 2.63/1.20  % unary                                 50
% 2.63/1.20  % binary                                60
% 2.63/1.20  % lits                                  370
% 2.63/1.20  % lits eq                               0
% 2.63/1.20  % fd_pure                               0
% 2.63/1.20  % fd_pseudo                             0
% 2.63/1.20  % fd_cond                               0
% 2.63/1.20  % fd_pseudo_cond                        0
% 2.63/1.20  % AC symbols                            0
% 2.63/1.20  
% 2.63/1.20  % ------ Schedule EPR non Horn non eq is on
% 2.63/1.20  
% 2.63/1.20  % ------ no equalities: superposition off 
% 2.63/1.20  
% 2.63/1.20  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.63/1.20  
% 2.63/1.20  
% 2.63/1.20  % ------ 
% 2.63/1.20  % Current options:
% 2.63/1.20  % ------ 
% 2.63/1.20  
% 2.63/1.20  
% 2.63/1.20  % 
% 2.63/1.20  
% 2.63/1.20  % ------ Proving...
% 2.63/1.20  % 
% 2.63/1.20  
% 2.63/1.20  % SZS status Unsatisfiable for theBenchmark.p
% 2.63/1.20  
% 2.63/1.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.63/1.20  
% 2.63/1.20  
%------------------------------------------------------------------------------