↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 0.67s 6.12s
% Output   : CNFRefutation 0.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (  12 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   81 (  42   ~;  39   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   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  :   14 (  13 usr;   3 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   45 (   0 sgn  45   !;   0   ?;  27   :)

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

fof(f10,axiom,
    p0(b,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_10) ).

fof(f19,axiom,
    ! [X0,X1] : m0(X0,d,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).

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

fof(f41,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m0(X1,X0,X2)
      | ~ r0(X3)
      | ~ p0(X2,X0)
      | l1(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).

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

fof(f151,axiom,
    ! [X2,X0,X1] :
      ( ~ m1(X0,X1,X1)
      | ~ r0(X2)
      | q1(X0,X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_113) ).

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

fof(f282,axiom,
    ! [X0] :
      ( ~ n2(X0)
      | p3(X0,X0,X0) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_299) ).

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

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

tcf(c_427,plain,
    p0(b,d),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_436,plain,
    ! [X0: $i,X1: $i] : m0(X0,d,X1),
    inference(cnf_transformation,[],[f19]) ).

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

tcf(c_458,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( l1(X1,X0)
      | ~ r0(X3)
      | ~ p0(X2,X1)
      | ~ m0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f41]) ).

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

tcf(c_566,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( q1(X0,X0,X1)
      | ~ r0(X2)
      | ~ m1(X0,X1,X1) ),
    inference(cnf_transformation,[],[f151]) ).

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(d),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_771,plain,
    m0(b,d,b),
    inference(instantiation,[status(thm)],[c_436]) ).

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_1137,plain,
    ! [X0: $i] :
      ( ~ iPr_def_61
      | ~ r0(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_61])],[c_566]) ).

tcf(c_1178,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ iPr_def_86
      | ~ p0(X2,X1)
      | l1(X1,X0)
      | ~ m0(X0,X1,X2) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_86])],[c_458]) ).

tcf(c_1179,plain,
    ( iPr_def_86
    | iPr_def_61 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_458]) ).

tcf(c_1187,plain,
    ( ~ iPr_def_61
    | ~ r0(b) ),
    inference(instantiation,[status(thm)],[c_1137]) ).

tcf(c_1527,plain,
    ! [X0: $i,X1: $i] :
      ( l1(d,X0)
      | ~ iPr_def_86
      | ~ p0(X1,d)
      | ~ m0(X0,d,X1) ),
    inference(instantiation,[status(thm)],[c_1178]) ).

tcf(c_1528,plain,
    ( l1(d,b)
    | ~ iPr_def_86
    | ~ p0(b,d)
    | ~ m0(b,d,b) ),
    inference(instantiation,[status(thm)],[c_1527]) ).

tcf(c_1763,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( s4(d)
      | ~ l1(d,X1)
      | ~ p3(X0,X1,X2) ),
    inference(instantiation,[status(thm)],[c_747]) ).

tcf(c_1764,plain,
    ( s4(d)
    | ~ l1(d,b)
    | ~ p3(b,b,b) ),
    inference(instantiation,[status(thm)],[c_1763]) ).

tcf(c_1765,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1764,c_1528,c_1187,c_1179,c_790,c_788,c_782,c_771,c_427,c_768,c_426,c_449]) ).


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