↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.70s 6.24s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   47 (  25   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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  :    9 (   8 usr;   3 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?;  10   :)

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

fof(f25,axiom,
    q0(d,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_25) ).

fof(f37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).

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

fof(f72,axiom,
    ! [X0,X1] :
      ( ~ q0(X0,X0)
      | ~ k1(X1)
      | ~ k1(a)
      | m1(X0,X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_034) ).

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(f369,negated_conjecture,
    ~ q1(d,d,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tcf(c_418,negated_conjecture,
    ~ q1(d,d,a),
    inference(cnf_transformation,[],[f369]) ).

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

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

tcf(c_531,plain,
    ! [X0: $i,X1: $i] :
      ( m1(X0,X1,X1)
      | ~ k1(a)
      | ~ k1(X1)
      | ~ q0(X0,X0) ),
    inference(cnf_transformation,[],[f72]) ).

tcf(c_536,plain,
    q0(d,d),
    inference(cnf_transformation,[],[f25]) ).

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

tcf(c_595,plain,
    n0(b,a),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_972,plain,
    ! [X0: $i] :
      ( ~ iPr_def_16
      | ~ r0(X0) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_16])],[c_451]) ).

tcf(c_973,plain,
    ! [X0: $i,X1: $i] :
      ( ~ iPr_def_17
      | q1(X0,X0,X1)
      | ~ m1(X0,X1,X1) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_17])],[c_451]) ).

tcf(c_974,plain,
    ( iPr_def_17
    | iPr_def_16 ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_451]) ).

tcf(c_1019,plain,
    ( ~ iPr_def_16
    | ~ r0(b) ),
    inference(instantiation,[status(thm)],[c_972]) ).

tcf(c_1047,plain,
    ( q1(d,d,a)
    | ~ iPr_def_17
    | ~ m1(d,a,a) ),
    inference(instantiation,[status(thm)],[c_973]) ).

tcf(c_1067,plain,
    ( k1(a)
    | ~ n0(b,a) ),
    inference(instantiation,[status(thm)],[c_594]) ).

tcf(c_1203,plain,
    ( m1(d,a,a)
    | ~ k1(a)
    | ~ q0(d,d) ),
    inference(instantiation,[status(thm)],[c_531]) ).

tcf(c_1204,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1203,c_1067,c_1047,c_1019,c_974,c_418,c_536,c_595,c_511]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN293-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/5.38  % Computer : n003.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Fri Sep 25 00:46:43 UTC 2026
% 0.09/5.39  % CPUTime  : 
% 0.09/5.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.42  Running EPR theorem proving
% 0.13/5.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.13/5.43  
% 0.13/5.43  % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.43  
% 0.13/5.43  % Detected problem language: tptp
% 0.13/5.44  % Proving...
% 2.70/6.24  % SZS status Started for theBenchmark.p
% 2.70/6.24  % SZS status Unsatisfiable for theBenchmark.p
% 2.70/6.24  
% 2.70/6.24  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.70/6.24  
% 2.70/6.24  % ------  iProver source info
% 2.70/6.24  
% 2.70/6.24  % git: date: 2026-07-19 20:42:38 +0200
% 2.70/6.24  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.70/6.24  % git: non_committed_changes: false
% 2.70/6.24  
% 2.70/6.24  % ------ Parsing...% successful
% 2.70/6.24  
% 2.70/6.24  
% 2.70/6.24  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 2.70/6.24  % 
% 2.70/6.24  
% 2.70/6.24  % ------ Preprocessing... sf_s  rm: 142 0s  sf_e  sf_s  rm: 0 0s  sf_e % 
% 2.70/6.24  
% 2.70/6.24  % ------ Preprocessing...% ------  preprocesses with Option_epr_horn
% 2.70/6.24   gs_s  sp: 40 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 2.70/6.24  % ------ Proving...
% 2.70/6.24  % ------ Problem Properties 
% 2.70/6.24  
% 2.70/6.24  % 
% 2.70/6.24  % clauses                               168
% 2.70/6.24  % conjectures                           1
% 2.70/6.24  % EPR                                   168
% 2.70/6.24  % Horn                                  148
% 2.70/6.24  % unary                                 50
% 2.70/6.24  % binary                                60
% 2.70/6.24  % lits                                  364
% 2.70/6.24  % lits eq                               0
% 2.70/6.24  % fd_pure                               0
% 2.70/6.24  % fd_pseudo                             0
% 2.70/6.24  % fd_cond                               0
% 2.70/6.24  % fd_pseudo_cond                        0
% 2.70/6.24  % AC symbols                            0
% 2.70/6.24  
% 2.70/6.24  % ------ Schedule EPR non Horn non eq is on
% 2.70/6.24  
% 2.70/6.24  % ------ no equalities: superposition off 
% 2.70/6.24  
% 2.70/6.24  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 2.70/6.24  
% 2.70/6.24  
% 2.70/6.24  % ------ 
% 2.70/6.24  % Current options:
% 2.70/6.24  % ------ 
% 2.70/6.24  
% 2.70/6.24  
% 2.70/6.24  % 
% 2.70/6.24  
% 2.70/6.24  % ------ Proving...
% 2.70/6.24  % 
% 2.70/6.24  
% 2.70/6.24  % SZS status Unsatisfiable for theBenchmark.p
% 2.70/6.24  
% 2.70/6.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.70/6.24  
% 2.70/6.24  
%------------------------------------------------------------------------------