↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.70s 1.22s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  21   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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;   3 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    s0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).

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

fof(f135,axiom,
    ! [X0] :
      ( ~ s0(X0)
      | q1(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_097) ).

fof(f167,axiom,
    ! [X0,X1] :
      ( ~ q1(X1,X0,X0)
      | k2(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).

fof(f290,axiom,
    ! [X2,X0,X1] :
      ( ~ k2(X2,X2)
      | ~ q0(X1,X0)
      | p3(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_252) ).

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

tcf(c_418,negated_conjecture,
    ! [X0: $i,X1: $i] : ~ p3(X0,d,X1),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_431,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( p3(X1,X1,X1)
      | ~ k2(X2,X2)
      | ~ q0(X0,X1) ),
    inference(cnf_transformation,[],[f290]) ).

tcf(c_514,plain,
    ! [X0: $i] :
      ( q1(X0,X0,X0)
      | ~ s0(X0) ),
    inference(cnf_transformation,[],[f135]) ).

tcf(c_565,plain,
    ! [X0: $i,X1: $i] :
      ( k2(X1,X1)
      | ~ q1(X0,X1,X1) ),
    inference(cnf_transformation,[],[f167]) ).

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

tcf(c_659,plain,
    s0(b),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_776,plain,
    ( q1(b,b,b)
    | ~ s0(b) ),
    inference(instantiation,[status(thm)],[c_514]) ).

tcf(c_785,plain,
    ( k2(b,b)
    | ~ q1(b,b,b) ),
    inference(instantiation,[status(thm)],[c_565]) ).

tcf(c_1098,plain,
    ! [X0: $i] :
      ( ~ iPr_def_53
      | ~ k2(X0,X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_53])],[c_431]) ).

tcf(c_1099,plain,
    ! [X0: $i,X1: $i] :
      ( ~ iPr_def_54
      | ~ q0(X1,X0)
      | p3(X0,X0,X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_54])],[c_431]) ).

tcf(c_1100,plain,
    ( iPr_def_54
    | iPr_def_53 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_431]) ).

tcf(c_1165,plain,
    ( ~ iPr_def_53
    | ~ k2(b,b) ),
    inference(instantiation,[status(thm)],[c_1098]) ).

tcf(c_1217,plain,
    ~ p3(d,d,d),
    inference(instantiation,[status(thm)],[c_418]) ).

tcf(c_1604,plain,
    ! [X0: $i] :
      ( p3(d,d,d)
      | ~ iPr_def_54
      | ~ q0(X0,d) ),
    inference(instantiation,[status(thm)],[c_1099]) ).

tcf(c_1606,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1604,c_1217,c_1165,c_1100,c_785,c_776,c_585,c_659]) ).


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