↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN207-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 : n008.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 2.95s 6.44s
% Output   : CNFRefutation 2.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   67 (  23 unt;   0 def)
%            Number of atoms       :  152 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  174 (  89   ~;  85   |;   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  :   18 (  17 usr;   5 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   66 (   0 sgn  66   !;   0   ?;  42   :)

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

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

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

fof(f14,axiom,
    ! [X0] : p0(b,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

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

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

fof(f29,axiom,
    q0(d,b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_29) ).

fof(f34,axiom,
    n0(c,d),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_34) ).

fof(f35,axiom,
    m0(d,e,c),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_35) ).

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

fof(f70,axiom,
    ! [X0] :
      ( ~ s0(X0)
      | m1(X0,X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_032) ).

fof(f163,axiom,
    ! [X0] :
      ( ~ p0(X0,X0)
      | s1(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).

fof(f164,axiom,
    ! [X2,X0,X1] :
      ( ~ s1(X2)
      | ~ q0(X0,X1)
      | s1(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).

fof(f171,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m0(X3,X2,X0)
      | ~ s1(X2)
      | ~ p0(X1,X1)
      | l2(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).

fof(f172,axiom,
    ! [X2,X0,X1] :
      ( ~ p0(X1,X0)
      | ~ m1(X2,X1,X1)
      | ~ m0(X1,X0,X2)
      | l2(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_134) ).

fof(f221,axiom,
    ! [X0,X1] :
      ( ~ l2(X1,X0)
      | ~ l0(c)
      | ~ k1(X1)
      | q2(X0,c,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_183) ).

fof(f227,axiom,
    ! [X0] :
      ( ~ s1(b)
      | ~ q2(b,X0,b)
      | s2(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).

fof(f311,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m0(X2,X3,X1)
      | ~ s2(X0)
      | ~ q2(X2,X0,X2)
      | s3(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).

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

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

tcf(c_426,plain,
    m0(d,e,c),
    inference(cnf_transformation,[],[f35]) ).

tcf(c_432,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( s3(X3,X2)
      | ~ s2(X3)
      | ~ q2(X0,X3,X0)
      | ~ m0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f311]) ).

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

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

tcf(c_521,plain,
    ! [X0: $i] : p0(b,X0),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_531,plain,
    ! [X0: $i,X1: $i] :
      ( q2(X1,c,X0)
      | ~ l0(c)
      | ~ k1(X0)
      | ~ l2(X0,X1) ),
    inference(cnf_transformation,[],[f221]) ).

tcf(c_533,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( l2(X1,X1)
      | ~ p0(X0,X1)
      | ~ m1(X2,X0,X0)
      | ~ m0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f172]) ).

tcf(c_534,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( l2(X2,X2)
      | ~ s1(X1)
      | ~ p0(X3,X3)
      | ~ m0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f171]) ).

tcf(c_564,plain,
    ! [X0: $i] :
      ( s2(X0)
      | ~ s1(b)
      | ~ q2(b,X0,b) ),
    inference(cnf_transformation,[],[f227]) ).

tcf(c_572,plain,
    ! [X0: $i] :
      ( m1(X0,X0,X0)
      | ~ s0(X0) ),
    inference(cnf_transformation,[],[f70]) ).

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

tcf(c_594,plain,
    q0(d,b),
    inference(cnf_transformation,[],[f29]) ).

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

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

tcf(c_633,plain,
    n0(c,d),
    inference(cnf_transformation,[],[f34]) ).

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

tcf(c_706,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( s1(X0)
      | ~ s1(X2)
      | ~ q0(X0,X1) ),
    inference(cnf_transformation,[],[f164]) ).

tcf(c_707,plain,
    ! [X0: $i] :
      ( s1(X0)
      | ~ p0(X0,X0) ),
    inference(cnf_transformation,[],[f163]) ).

tcf(c_767,plain,
    p0(b,b),
    inference(instantiation,[status(thm)],[c_521]) ).

tcf(c_769,plain,
    m0(b,d,b),
    inference(instantiation,[status(thm)],[c_489]) ).

tcf(c_771,plain,
    ( s1(b)
    | ~ p0(b,b) ),
    inference(instantiation,[status(thm)],[c_707]) ).

tcf(c_787,plain,
    ( m1(b,b,b)
    | ~ s0(b) ),
    inference(instantiation,[status(thm)],[c_572]) ).

tcf(c_976,plain,
    ! [X0: $i] :
      ( s2(X0)
      | ~ q2(b,X0,b) ),
    inference(global_subsumption_just,[status(thm)],[c_564,c_767,c_771,c_564]) ).

tcf(c_1026,plain,
    ! [X0: $i,X1: $i] :
      ( q2(X1,c,X0)
      | ~ l2(X0,X1)
      | ~ k1(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_531,c_623,c_531]) ).

tcf(c_1027,plain,
    ! [X0: $i,X1: $i] :
      ( q2(X1,c,X0)
      | ~ k1(X0)
      | ~ l2(X0,X1) ),
    inference(renaming,[status(thm)],[c_1026]) ).

tcf(c_1028,plain,
    ( q2(b,c,b)
    | ~ k1(b)
    | ~ l2(b,b) ),
    inference(instantiation,[status(thm)],[c_1027]) ).

tcf(c_1068,plain,
    ! [X0: $i] :
      ( ~ iPr_def_18
      | ~ p0(X0,X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_18])],[c_534]) ).

tcf(c_1069,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ iPr_def_19
      | ~ s1(X1)
      | l2(X2,X2)
      | ~ m0(X0,X1,X2) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_19])],[c_534]) ).

tcf(c_1070,plain,
    ( iPr_def_19
    | iPr_def_18 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_534]) ).

tcf(c_1071,plain,
    ! [X0: $i] :
      ( ~ iPr_def_20
      | ~ s1(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_20])],[c_706]) ).

tcf(c_1072,plain,
    ! [X0: $i,X1: $i] :
      ( ~ iPr_def_21
      | s1(X0)
      | ~ q0(X0,X1) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_21])],[c_706]) ).

tcf(c_1073,plain,
    ( iPr_def_21
    | iPr_def_20 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_706]) ).

tcf(c_1120,plain,
    ( ~ iPr_def_20
    | ~ s1(b) ),
    inference(instantiation,[status(thm)],[c_1071]) ).

tcf(c_1124,plain,
    ( ~ iPr_def_18
    | ~ p0(b,b) ),
    inference(instantiation,[status(thm)],[c_1068]) ).

tcf(c_1154,plain,
    ! [X0: $i] :
      ( s3(X0,c)
      | ~ s2(X0)
      | ~ m0(d,e,c)
      | ~ q2(d,X0,d) ),
    inference(instantiation,[status(thm)],[c_432]) ).

tcf(c_1178,plain,
    ( k1(b)
    | ~ n0(d,b) ),
    inference(instantiation,[status(thm)],[c_608]) ).

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

tcf(c_1189,plain,
    ! [X0: $i] :
      ( s1(d)
      | ~ iPr_def_21
      | ~ q0(d,X0) ),
    inference(instantiation,[status(thm)],[c_1072]) ).

tcf(c_1190,plain,
    ( s1(d)
    | ~ iPr_def_21
    | ~ q0(d,b) ),
    inference(instantiation,[status(thm)],[c_1189]) ).

tcf(c_1285,plain,
    ! [X0: $i,X1: $i] :
      ( l2(X1,X1)
      | ~ iPr_def_19
      | ~ s1(d)
      | ~ m0(X0,d,X1) ),
    inference(instantiation,[status(thm)],[c_1069]) ).

tcf(c_1286,plain,
    ( l2(b,b)
    | ~ iPr_def_19
    | ~ s1(d)
    | ~ m0(b,d,b) ),
    inference(instantiation,[status(thm)],[c_1285]) ).

tcf(c_1336,plain,
    ! [X0: $i,X1: $i] :
      ( l2(d,d)
      | ~ p0(X1,d)
      | ~ m0(X1,d,X0)
      | ~ m1(X0,X1,X1) ),
    inference(instantiation,[status(thm)],[c_533]) ).

tcf(c_1337,plain,
    ( l2(d,d)
    | ~ p0(b,d)
    | ~ m1(b,b,b)
    | ~ m0(b,d,b) ),
    inference(instantiation,[status(thm)],[c_1336]) ).

tcf(c_1389,plain,
    ( q2(d,c,d)
    | ~ k1(d)
    | ~ l2(d,d) ),
    inference(instantiation,[status(thm)],[c_1027]) ).

tcf(c_1390,plain,
    ( s3(c,c)
    | ~ s2(c)
    | ~ q2(d,c,d)
    | ~ m0(d,e,c) ),
    inference(instantiation,[status(thm)],[c_1154]) ).

tcf(c_1471,plain,
    ( s2(c)
    | ~ q2(b,c,b) ),
    inference(instantiation,[status(thm)],[c_976]) ).

tcf(c_1472,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1471,c_1390,c_1389,c_1337,c_1286,c_1190,c_1183,c_1178,c_1124,c_1120,c_1073,c_1070,c_1028,c_787,c_771,c_426,c_769,c_418,c_490,c_767,c_594,c_633,c_638,c_577]) ).


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