↑ Up

iProver---3.9.4.UNS-CRf.s

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

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

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

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

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

fof(f106,axiom,
    ! [X0] :
      ( ~ k0(X0)
      | p1(X0,X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_068) ).

fof(f175,axiom,
    ! [X2,X0,X1] :
      ( ~ p1(X1,X2,X0)
      | n2(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).

fof(f282,axiom,
    ! [X0] :
      ( ~ n2(X0)
      | p3(X0,X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_244) ).

fof(f337,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ l1(X0,X2)
      | ~ p3(X1,X2,X3)
      | s4(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).

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

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

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

tcf(c_457,plain,
    ! [X0: $i,X1: $i] :
      ( l1(X1,X1)
      | ~ n0(X0,X1) ),
    inference(cnf_transformation,[],[f40]) ).

tcf(c_522,plain,
    ! [X0: $i] :
      ( p1(X0,X0,X0)
      | ~ k0(X0) ),
    inference(cnf_transformation,[],[f106]) ).

tcf(c_589,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( n2(X2)
      | ~ p1(X0,X1,X2) ),
    inference(cnf_transformation,[],[f175]) ).

tcf(c_694,plain,
    ! [X0: $i] :
      ( p3(X0,X0,X0)
      | ~ n2(X0) ),
    inference(cnf_transformation,[],[f282]) ).

tcf(c_747,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( s4(X3)
      | ~ l1(X3,X1)
      | ~ p3(X0,X1,X2) ),
    inference(cnf_transformation,[],[f337]) ).

tcf(c_768,negated_conjecture,
    ~ s4(b),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_782,plain,
    ( p3(b,b,b)
    | ~ n2(b) ),
    inference(instantiation,[status(thm)],[c_694]) ).

tcf(c_788,plain,
    ( n2(b)
    | ~ p1(b,b,b) ),
    inference(instantiation,[status(thm)],[c_589]) ).

tcf(c_790,plain,
    ( p1(b,b,b)
    | ~ k0(b) ),
    inference(instantiation,[status(thm)],[c_522]) ).

tcf(c_839,plain,
    ( s4(b)
    | ~ l1(b,b)
    | ~ p3(b,b,b) ),
    inference(instantiation,[status(thm)],[c_747]) ).

tcf(c_1257,plain,
    ( l1(b,b)
    | ~ n0(d,b) ),
    inference(instantiation,[status(thm)],[c_457]) ).

tcf(c_1258,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1257,c_839,c_790,c_788,c_782,c_424,c_768,c_449]) ).


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