↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV861-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n010.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:24:22 PM UTC 2026

% Result   : Unsatisfiable 3.94s 1.30s
% Output   : CNFRefutation 3.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   16 (   9 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;  10 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn  15   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f630,negated_conjecture,
    hBOOL(hAPP(hAPP(v_P,v_Z),v_s)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f631,negated_conjecture,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f632,negated_conjecture,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f633,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(v_R,v_Z),v_s_H)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f635,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ hBOOL(hAPP(hAPP(v_P,X0),X2))
      | ~ c_Natural_Oevaln(v_c,X2,v_n,X1)
      | hBOOL(hAPP(hAPP(v_Q,X0),X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f636,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ hBOOL(hAPP(hAPP(v_Q,X0),X2))
      | ~ c_Natural_Oevaln(v_d,X2,v_n,X1)
      | hBOOL(hAPP(hAPP(v_R,X0),X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).

tcf(c_1213,negated_conjecture,
    hBOOL(hAPP(hAPP(v_P,v_Z),v_s)),
    inference(cnf_transformation,[],[f630]) ).

tcf(c_1214,negated_conjecture,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    inference(cnf_transformation,[],[f631]) ).

tcf(c_1215,negated_conjecture,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    inference(cnf_transformation,[],[f632]) ).

tcf(c_1216,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(v_R,v_Z),v_s_H)),
    inference(cnf_transformation,[],[f633]) ).

tcf(c_1218,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( hBOOL(hAPP(hAPP(v_Q,X0),X2))
      | ~ c_Natural_Oevaln(v_c,X1,v_n,X2)
      | ~ hBOOL(hAPP(hAPP(v_P,X0),X1)) ),
    inference(cnf_transformation,[],[f635]) ).

tcf(c_1219,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( hBOOL(hAPP(hAPP(v_R,X0),X2))
      | ~ c_Natural_Oevaln(v_d,X1,v_n,X2)
      | ~ hBOOL(hAPP(hAPP(v_Q,X0),X1)) ),
    inference(cnf_transformation,[],[f636]) ).

tcf(c_1377,plain,
    ! [X0: $i] :
      ( hBOOL(hAPP(hAPP(v_Q,v_Z),X0))
      | ~ c_Natural_Oevaln(v_c,v_s,v_n,X0) ),
    inference(superposition,[status(thm)],[c_1213,c_1218]) ).

tcf(c_1418,plain,
    ! [X0: $i,X1: $i] :
      ( hBOOL(hAPP(hAPP(v_R,v_Z),X1))
      | ~ c_Natural_Oevaln(v_c,v_s,v_n,X0)
      | ~ c_Natural_Oevaln(v_d,X0,v_n,X1) ),
    inference(superposition,[status(thm)],[c_1377,c_1219]) ).

tcf(c_1458,plain,
    ( hBOOL(hAPP(hAPP(v_R,v_Z),v_s_H))
    | ~ c_Natural_Oevaln(v_c,v_s,v_n,v_s1) ),
    inference(superposition,[status(thm)],[c_1215,c_1418]) ).

tcf(c_1460,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1458,c_1216,c_1214]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV861-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Thu Sep 24 21:11:58 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40  Running first-order theorem proving
% 0.12/0.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41  
% 0.12/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41  
% 0.12/0.41  % Detected problem language: tptp
% 0.12/0.43  % Proving...
% 3.94/1.30  % SZS status Started for theBenchmark.p
% 3.94/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.94/1.30  
% 3.94/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.94/1.30  
% 3.94/1.30  % ------  iProver source info
% 3.94/1.30  
% 3.94/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 3.94/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.94/1.30  % git: non_committed_changes: false
% 3.94/1.30  
% 3.94/1.30  % ------ Parsing...% successful
% 3.94/1.30  
% 3.94/1.30  
% 3.94/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 3.94/1.30  % ------ Proving...
% 3.94/1.30  % ------ Problem Properties 
% 3.94/1.30  
% 3.94/1.30  % 
% 3.94/1.30  % clauses                               596
% 3.94/1.30  % conjectures                           7
% 3.94/1.30  % EPR                                   78
% 3.94/1.30  % Horn                                  511
% 3.94/1.30  % unary                                 163
% 3.94/1.30  % binary                                208
% 3.94/1.30  % lits                                  1324
% 3.94/1.30  % lits eq                               298
% 3.94/1.30  % fd_pure                               0
% 3.94/1.30  % fd_pseudo                             0
% 3.94/1.30  % fd_cond                               0
% 3.94/1.30  % fd_pseudo_cond                        71
% 3.94/1.30  % AC symbols                            0
% 3.94/1.30  
% 3.94/1.30  % ------ Input Options Time Limit: Unbounded
% 3.94/1.30  
% 3.94/1.30  
% 3.94/1.30  % ------ 
% 3.94/1.30  % Current options:
% 3.94/1.30  % ------ 
% 3.94/1.30  
% 3.94/1.30  
% 3.94/1.30  % 
% 3.94/1.30  
% 3.94/1.30  % ------ Proving...
% 3.94/1.30  % 
% 3.94/1.30  
% 3.94/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.94/1.30  
% 3.94/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.30  
% 3.94/1.30  
%------------------------------------------------------------------------------