↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n020.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:17:29 PM UTC 2026

% Result   : Theorem 3.70s 21.55s
% Output   : CNFRefutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  21 unt;   2 def)
%            Number of atoms       :   50 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   28 (  18   ~;   4   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-3 aty)
%            Number of variables   :   50 (   0 sgn  46   !;   4   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,axiom,
    ! [X0,X1] :
      ( ok(triple(X0,X1,bad))
    <=> $false ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).

fof(f29,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => X2 = bad ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).

fof(f30,axiom,
    ! [X0,X1,X2,X3] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).

fof(f42,conjecture,
    ! [X0,X1,X2,X3] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(insert_cpq(triple(X0,X1,X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l13_co) ).

fof(f43,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ~ ok(triple(X0,X1,X2))
       => ~ ok(insert_cpq(triple(X0,X1,X2),X3)) ),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f46,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(true_and_false_elimination,[],[f28]) ).

fof(f47,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(flattening,[],[f46]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( ok(triple(X0,X1,X2))
      | X2 = bad ),
    inference(ennf_transformation,[],[f29]) ).

fof(f82,plain,
    ? [X0,X1,X2,X3] :
      ( ~ ok(triple(X0,X1,X2))
      & ok(insert_cpq(triple(X0,X1,X2),X3)) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f89,plain,
    ( ~ ok(triple(sK0,sK1,sK2))
    & ok(insert_cpq(triple(sK0,sK1,sK2),sK3)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f82]) ).

fof(f124,plain,
    ! [X0,X1] : ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f47]) ).

fof(f125,plain,
    ! [X2,X0,X1] :
      ( ok(triple(X0,X1,X2))
      | bad = X2 ),
    inference(cnf_transformation,[],[f69]) ).

fof(f126,plain,
    ! [X2,X3,X0,X1] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
    inference(cnf_transformation,[],[f30]) ).

fof(f138,plain,
    ~ ok(triple(sK0,sK1,sK2)),
    inference(cnf_transformation,[],[f89]) ).

fof(f139,plain,
    ok(insert_cpq(triple(sK0,sK1,sK2),sK3)),
    inference(cnf_transformation,[],[f89]) ).

tcf(c_83,plain,
    ! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
    inference(cnf_transformation,[],[f124]) ).

tcf(c_84,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ok(triple(X1,X2,X0))
      | ( X0 = bad ) ),
    inference(cnf_transformation,[],[f125]) ).

tcf(c_85,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : triple(insert_pqp(X0,X1),insert_slb(X2,pair(X1,bottom)),X3) = insert_cpq(triple(X0,X2,X3),X1),
    inference(cnf_transformation,[],[f126]) ).

tcf(c_95,negated_conjecture,
    ok(insert_cpq(triple(sK0,sK1,sK2),sK3)),
    inference(cnf_transformation,[],[f139]) ).

tcf(c_96,negated_conjecture,
    ~ ok(triple(sK0,sK1,sK2)),
    inference(cnf_transformation,[],[f138]) ).

tcf(c_919,definition,
    iPr_def_10 = triple(sK0,sK1,sK2),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_920,definition,
    iPr_def_11 = insert_cpq(iPr_def_10,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_921,negated_conjecture,
    ~ ok(iPr_def_10),
    inference(demodulation,[status(thm)],[c_96,c_919]) ).

tcf(c_922,negated_conjecture,
    ok(iPr_def_11),
    inference(demodulation,[status(thm)],[c_95,c_920]) ).

tcf(c_1480,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ ok(insert_cpq(triple(X0,X1,bad),X2)),
    inference(superposition,[status(thm)],[c_85,c_83]) ).

tcf(c_1489,plain,
    ( ok(iPr_def_10)
    | ( bad = sK2 ) ),
    inference(superposition,[status(thm)],[c_919,c_84]) ).

tcf(c_1491,plain,
    bad = sK2,
    inference(forward_subsumption_resolution,[status(thm)],[c_1489,c_921]) ).

tcf(c_1494,plain,
    triple(sK0,sK1,bad) = iPr_def_10,
    inference(demodulation,[status(thm)],[c_919,c_1491]) ).

tcf(c_1496,plain,
    ! [X0: $i] : ~ ok(insert_cpq(iPr_def_10,X0)),
    inference(superposition,[status(thm)],[c_1494,c_1480]) ).

tcf(c_1500,plain,
    ~ ok(iPr_def_11),
    inference(superposition,[status(thm)],[c_920,c_1496]) ).

tcf(c_1501,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1500,c_922]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV377+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/20.61  % Computer : n020.cluster.edu
% 0.12/20.61  % Model    : x86_64 x86_64
% 0.12/20.61  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/20.61  % Memory   : 8046.5625MB
% 0.12/20.61  % OS       : Linux 6.8.0-71-generic
% 0.12/20.61  % CPULimit : 300
% 0.12/20.61  % WCLimit  : 300
% 0.12/20.61  % DateTime : Thu Sep 24 19:25:56 UTC 2026
% 0.12/20.61  % CPUTime  : 
% 0.12/20.61  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/20.65  Running first-order theorem proving
% 0.12/20.65  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/20.66  
% 0.12/20.66  % ======== iProver multi-core TPTP/SMT =========
% 0.12/20.66  
% 0.12/20.66  % Detected problem language: tptp
% 0.12/20.68  % Proving...
% 3.70/21.55  % SZS status Started for theBenchmark.p
% 3.70/21.55  % SZS status Theorem for theBenchmark.p
% 3.70/21.55  
% 3.70/21.55  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.70/21.55  
% 3.70/21.55  % ------  iProver source info
% 3.70/21.55  
% 3.70/21.55  % git: date: 2026-07-19 20:42:38 +0200
% 3.70/21.55  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.70/21.55  % git: non_committed_changes: false
% 3.70/21.55  
% 3.70/21.55  % ------ Parsing...
% 3.70/21.55  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.70/21.55  
% 3.70/21.55  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 7 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 3.70/21.55  
% 3.70/21.55  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.70/21.55  
% 3.70/21.55  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.70/21.55  % ------ Proving...
% 3.70/21.55  % ------ Problem Properties 
% 3.70/21.55  
% 3.70/21.55  % 
% 3.70/21.55  % clauses                               43
% 3.70/21.55  % conjectures                           2
% 3.70/21.55  % EPR                                   8
% 3.70/21.55  % Horn                                  29
% 3.70/21.55  % unary                                 19
% 3.70/21.55  % binary                                12
% 3.70/21.55  % lits                                  80
% 3.70/21.55  % lits eq                               30
% 3.70/21.55  % fd_pure                               0
% 3.70/21.55  % fd_pseudo                             0
% 3.70/21.55  % fd_cond                               5
% 3.70/21.55  % fd_pseudo_cond                        5
% 3.70/21.55  % AC symbols                            0
% 3.70/21.55  
% 3.70/21.55  % ------ Schedule dynamic 5 is on 
% 3.70/21.55  
% 3.70/21.55  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.70/21.55  
% 3.70/21.55  
% 3.70/21.55  % ------ 
% 3.70/21.55  % Current options:
% 3.70/21.55  % ------ 
% 3.70/21.55  
% 3.70/21.55  
% 3.70/21.55  % 
% 3.70/21.55  
% 3.70/21.55  % ------ Proving...
% 3.70/21.55  % 
% 3.70/21.55  
% 3.70/21.55  % SZS status Theorem for theBenchmark.p
% 3.70/21.55  
% 3.70/21.55  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/21.55  
% 3.70/21.55  
%------------------------------------------------------------------------------