↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 0.67s 1.12s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (   7 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   79 (  41   ~;  38   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   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  :   13 (  12 usr;   3 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   34 (   0 sgn  34   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    n0(d,c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_26) ).

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

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

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

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

fof(f219,axiom,
    ! [X0] :
      ( ~ p1(X0,X0,X0)
      | q2(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).

fof(f248,axiom,
    ! [X0] :
      ( ~ n2(X0)
      | k3(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_210) ).

fof(f274,axiom,
    ! [X0] :
      ( ~ n2(X0)
      | m3(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).

fof(f333,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ m3(X3,X4,X3)
      | ~ q2(X3,X1,X0)
      | ~ k3(X2,X2,X0)
      | q4(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_295) ).

fof(f340,axiom,
    ! [X0,X1] :
      ( ~ k1(X0)
      | ~ q4(X1,X1)
      | l5(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_302) ).

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

tcf(c_443,plain,
    n0(d,c),
    inference(cnf_transformation,[],[f26]) ).

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

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

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_633,plain,
    ! [X0: $i] :
      ( q2(X0,X0,X0)
      | ~ p1(X0,X0,X0) ),
    inference(cnf_transformation,[],[f219]) ).

tcf(c_660,plain,
    ! [X0: $i] :
      ( k3(X0,X0,X0)
      | ~ n2(X0) ),
    inference(cnf_transformation,[],[f248]) ).

tcf(c_686,plain,
    ! [X0: $i] :
      ( m3(X0,X0,X0)
      | ~ n2(X0) ),
    inference(cnf_transformation,[],[f274]) ).

tcf(c_743,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( q4(X2,X1)
      | ~ m3(X0,X4,X0)
      | ~ k3(X3,X3,X2)
      | ~ q2(X0,X1,X2) ),
    inference(cnf_transformation,[],[f333]) ).

tcf(c_750,plain,
    ! [X0: $i,X1: $i] :
      ( l5(X1)
      | ~ k1(X1)
      | ~ q4(X0,X0) ),
    inference(cnf_transformation,[],[f340]) ).

tcf(c_768,negated_conjecture,
    ~ l5(c),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_784,plain,
    ( m3(b,b,b)
    | ~ n2(b) ),
    inference(instantiation,[status(thm)],[c_686]) ).

tcf(c_786,plain,
    ( k3(b,b,b)
    | ~ n2(b) ),
    inference(instantiation,[status(thm)],[c_660]) ).

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_819,plain,
    ( q2(b,b,b)
    | ~ p1(b,b,b) ),
    inference(instantiation,[status(thm)],[c_633]) ).

tcf(c_914,plain,
    ( q4(b,b)
    | ~ m3(b,b,b)
    | ~ k3(b,b,b)
    | ~ q2(b,b,b) ),
    inference(instantiation,[status(thm)],[c_743]) ).

tcf(c_1067,plain,
    ! [X0: $i] :
      ( ~ iPr_def_15
      | l5(X0)
      | ~ k1(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_15])],[c_750]) ).

tcf(c_1068,plain,
    ! [X0: $i] :
      ( ~ iPr_def_16
      | ~ q4(X0,X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_16])],[c_750]) ).

tcf(c_1069,plain,
    ( iPr_def_16
    | iPr_def_15 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_750]) ).

tcf(c_1195,plain,
    ( ~ iPr_def_16
    | ~ q4(b,b) ),
    inference(instantiation,[status(thm)],[c_1068]) ).

tcf(c_1264,plain,
    ( k1(c)
    | ~ n0(d,c) ),
    inference(instantiation,[status(thm)],[c_456]) ).

tcf(c_1675,plain,
    ( l5(c)
    | ~ iPr_def_15
    | ~ k1(c) ),
    inference(instantiation,[status(thm)],[c_1067]) ).

tcf(c_1676,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1675,c_1264,c_1195,c_1069,c_914,c_819,c_790,c_788,c_786,c_784,c_443,c_768,c_449]) ).


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