↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.72s 1.16s
% Output   : CNFRefutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   49 (  18 unt;   0 def)
%            Number of atoms       :  103 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  112 (  58   ~;  54   |;   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  :   13 (  12 usr;   3 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   50 (   0 sgn  50   !;   0   ?;  32   :)

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

fof(f12,axiom,
    ! [X0] : m0(a,X0,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).

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

fof(f20,axiom,
    l0(a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

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

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

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

fof(f126,axiom,
    ( ~ l0(a)
    | p1(a,a,a) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_088) ).

fof(f174,axiom,
    ( ~ k1(b)
    | m2(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).

fof(f239,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m2(X2)
      | ~ m2(X3)
      | ~ p1(X1,X2,X0)
      | k3(X0,X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_201) ).

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

fof(f325,axiom,
    ! [X0,X1] :
      ( ~ k3(X0,X0,X1)
      | p4(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_287) ).

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

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

tcf(c_429,plain,
    ! [X0: $i] : m0(a,X0,a),
    inference(cnf_transformation,[],[f12]) ).

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

tcf(c_437,plain,
    l0(a),
    inference(cnf_transformation,[],[f20]) ).

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

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

tcf(c_535,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( p1(X1,X3,X0)
      | ~ p1(X0,X1,X2)
      | ~ m0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f120]) ).

tcf(c_541,plain,
    ( p1(a,a,a)
    | ~ l0(a) ),
    inference(cnf_transformation,[],[f126]) ).

tcf(c_588,plain,
    ( m2(b)
    | ~ k1(b) ),
    inference(cnf_transformation,[],[f174]) ).

tcf(c_652,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( k3(X2,X2,X0)
      | ~ m2(X3)
      | ~ m2(X1)
      | ~ p1(X0,X1,X2) ),
    inference(cnf_transformation,[],[f239]) ).

tcf(c_683,plain,
    ! [X0: $i,X1: $i] :
      ( m3(X1,X1,X1)
      | ~ n2(X1)
      | ~ m2(X0) ),
    inference(cnf_transformation,[],[f271]) ).

tcf(c_735,plain,
    ! [X0: $i,X1: $i] :
      ( p4(X0,X1,X0)
      | ~ k3(X0,X0,X1) ),
    inference(cnf_transformation,[],[f325]) ).

tcf(c_768,negated_conjecture,
    ! [X0: $i] : ~ p4(d,e,X0),
    inference(cnf_transformation,[],[f369]) ).

tcf(c_1095,plain,
    ! [X0: $i] :
      ( ~ iPr_def_33
      | ~ m2(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_33])],[c_683]) ).

tcf(c_1115,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ iPr_def_46
      | ~ m2(X2)
      | ~ p1(X1,X2,X0)
      | k3(X0,X0,X1) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_46])],[c_652]) ).

tcf(c_1116,plain,
    ( iPr_def_46
    | iPr_def_33 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_652]) ).

tcf(c_1203,plain,
    ( ~ iPr_def_33
    | ~ m2(b) ),
    inference(instantiation,[status(thm)],[c_1095]) ).

tcf(c_1287,plain,
    ( p4(d,e,d)
    | ~ k3(d,d,e) ),
    inference(instantiation,[status(thm)],[c_735]) ).

tcf(c_1288,plain,
    ~ p4(d,e,d),
    inference(instantiation,[status(thm)],[c_768]) ).

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

tcf(c_1564,plain,
    m0(a,a,a),
    inference(instantiation,[status(thm)],[c_429]) ).

tcf(c_1646,plain,
    ! [X0: $i,X1: $i] :
      ( p1(X0,X1,a)
      | ~ p1(a,X0,a)
      | ~ m0(a,X0,a) ),
    inference(instantiation,[status(thm)],[c_535]) ).

tcf(c_1650,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( p1(d,X2,X0)
      | ~ p1(X0,d,X1)
      | ~ m0(X0,d,X1) ),
    inference(instantiation,[status(thm)],[c_535]) ).

tcf(c_1658,plain,
    ! [X0: $i] :
      ( p1(e,X0,d)
      | ~ p1(d,e,c)
      | ~ m0(d,e,c) ),
    inference(instantiation,[status(thm)],[c_535]) ).

tcf(c_1659,plain,
    ( p1(e,b,d)
    | ~ p1(d,e,c)
    | ~ m0(d,e,c) ),
    inference(instantiation,[status(thm)],[c_1658]) ).

tcf(c_2213,plain,
    ! [X0: $i] :
      ( p1(X0,d,a)
      | ~ p1(a,X0,a)
      | ~ m0(a,X0,a) ),
    inference(instantiation,[status(thm)],[c_1646]) ).

tcf(c_2295,plain,
    ! [X0: $i] :
      ( k3(d,d,e)
      | ~ iPr_def_46
      | ~ m2(X0)
      | ~ p1(e,X0,d) ),
    inference(instantiation,[status(thm)],[c_1115]) ).

tcf(c_2296,plain,
    ( k3(d,d,e)
    | ~ iPr_def_46
    | ~ m2(b)
    | ~ p1(e,b,d) ),
    inference(instantiation,[status(thm)],[c_2295]) ).

tcf(c_2299,plain,
    ! [X0: $i] :
      ( p1(d,e,c)
      | ~ p1(c,d,X0)
      | ~ m0(c,d,X0) ),
    inference(instantiation,[status(thm)],[c_1650]) ).

tcf(c_2690,plain,
    ! [X0: $i] : m0(X0,d,a),
    inference(instantiation,[status(thm)],[c_436]) ).

tcf(c_2821,plain,
    m0(a,c,a),
    inference(instantiation,[status(thm)],[c_429]) ).

tcf(c_3305,plain,
    ( p1(d,e,c)
    | ~ p1(c,d,a)
    | ~ m0(c,d,a) ),
    inference(instantiation,[status(thm)],[c_2299]) ).

tcf(c_3306,plain,
    ( p1(c,d,a)
    | ~ p1(a,c,a)
    | ~ m0(a,c,a) ),
    inference(instantiation,[status(thm)],[c_2213]) ).

tcf(c_3425,plain,
    ( p1(a,c,a)
    | ~ p1(a,a,a)
    | ~ m0(a,a,a) ),
    inference(instantiation,[status(thm)],[c_1646]) ).

tcf(c_3872,plain,
    m0(c,d,a),
    inference(instantiation,[status(thm)],[c_2690]) ).

tcf(c_3873,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3872,c_3425,c_3306,c_3305,c_2821,c_2296,c_1659,c_1564,c_1297,c_1288,c_1287,c_1203,c_1116,c_541,c_588,c_452,c_424,c_437]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN272-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 : n013.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:40:37 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43  Running EPR theorem proving
% 0.11/0.43  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.44  
% 0.11/0.44  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44  
% 0.11/0.44  % Detected problem language: tptp
% 0.11/0.45  % Proving...
% 2.72/1.16  % SZS status Started for theBenchmark.p
% 2.72/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.72/1.16  
% 2.72/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.72/1.16  
% 2.72/1.16  % ------  iProver source info
% 2.72/1.16  
% 2.72/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 2.72/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.72/1.16  % git: non_committed_changes: false
% 2.72/1.16  
% 2.72/1.16  % ------ Parsing...% successful
% 2.72/1.16  
% 2.72/1.16  
% 2.72/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 2.72/1.16  % 
% 2.72/1.16  
% 2.72/1.16  % ------ Preprocessing... sf_s  rm: 40 0s  sf_e  sf_s  rm: 0 0s  sf_e % 
% 2.72/1.16  
% 2.72/1.16  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 2.72/1.16   gs_s  sp: 102 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.72/1.16  % ------ Proving...
% 2.72/1.16  % ------ Problem Properties 
% 2.72/1.16  
% 2.72/1.16  % 
% 2.72/1.16  % clauses                               380
% 2.72/1.16  % conjectures                           1
% 2.72/1.16  % EPR                                   380
% 2.72/1.16  % Horn                                  330
% 2.72/1.16  % unary                                 51
% 2.72/1.16  % binary                                154
% 2.72/1.16  % lits                                  948
% 2.72/1.16  % lits eq                               0
% 2.72/1.16  % fd_pure                               0
% 2.72/1.16  % fd_pseudo                             0
% 2.72/1.16  % fd_cond                               0
% 2.72/1.16  % fd_pseudo_cond                        0
% 2.72/1.16  % AC symbols                            0
% 2.72/1.16  
% 2.72/1.16  % ------ Schedule EPR non Horn non eq is on
% 2.72/1.16  
% 2.72/1.16  % ------ no equalities: superposition off 
% 2.72/1.16  
% 2.72/1.16  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.72/1.16  
% 2.72/1.16  
% 2.72/1.16  % ------ 
% 2.72/1.16  % Current options:
% 2.72/1.16  % ------ 
% 2.72/1.16  
% 2.72/1.16  
% 2.72/1.16  % 
% 2.72/1.16  
% 2.72/1.16  % ------ Proving...
% 2.72/1.16  % 
% 2.72/1.16  
% 2.72/1.16  % SZS status Unsatisfiable for theBenchmark.p
% 2.72/1.16  
% 2.72/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.72/1.16  
% 2.72/1.16  
%------------------------------------------------------------------------------