↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n026.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:28 PM UTC 2026

% Result   : Theorem 3.88s 16.30s
% Output   : CNFRefutation 3.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (  12 unt;   0 def)
%            Number of atoms       :   46 (   3 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  15   ~;  13   |;   3   &)
%                                         (   3 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   4 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  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :   40 (   0 sgn  34   !;   6   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0] : ~ contains_pq(create_pq,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax8) ).

fof(f20,axiom,
    ! [X0] : ~ contains_slb(create_slb,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax20) ).

fof(f39,axiom,
    ! [X0,X1,X2,X3] :
      ( contains_cpq(triple(X0,X1,X2),X3)
    <=> contains_slb(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).

fof(f54,axiom,
    ! [X0,X1] : i(triple(X0,create_slb,X1)) = create_pq,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).

fof(f63,conjecture,
    ! [X0,X1,X2] :
      ( contains_cpq(triple(X0,create_slb,X1),X2)
    <=> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l5_co) ).

fof(f64,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( contains_cpq(triple(X0,create_slb,X1),X2)
      <=> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
    inference(negated_conjecture,[status(cth)],[f63]) ).

fof(f115,plain,
    ? [X0,X1,X2] :
      ( contains_cpq(triple(X0,create_slb,X1),X2)
    <~> contains_pq(i(triple(X0,create_slb,X1)),X2) ),
    inference(ennf_transformation,[],[f64]) ).

fof(f124,plain,
    ! [X0,X1,X2,X3] :
      ( ( ~ contains_cpq(triple(X0,X1,X2),X3)
        | contains_slb(X1,X3) )
      & ( ~ contains_slb(X1,X3)
        | contains_cpq(triple(X0,X1,X2),X3) ) ),
    inference(nnf_transformation,[],[f39]) ).

fof(f125,plain,
    ? [X0,X1,X2] :
      ( ( contains_cpq(triple(X0,create_slb,X1),X2)
        | contains_pq(i(triple(X0,create_slb,X1)),X2) )
      & ( ~ contains_cpq(triple(X0,create_slb,X1),X2)
        | ~ contains_pq(i(triple(X0,create_slb,X1)),X2) ) ),
    inference(nnf_transformation,[],[f115]) ).

fof(f126,plain,
    ( ( contains_cpq(triple(sK1,create_slb,sK2),sK3)
      | contains_pq(i(triple(sK1,create_slb,sK2)),sK3) )
    & ( ~ contains_cpq(triple(sK1,create_slb,sK2),sK3)
      | ~ contains_pq(i(triple(sK1,create_slb,sK2)),sK3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f125]) ).

fof(f134,plain,
    ! [X0] : ~ contains_pq(create_pq,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f149,plain,
    ! [X0] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f20]) ).

fof(f174,plain,
    ! [X2,X3,X0,X1] :
      ( ~ contains_cpq(triple(X0,X1,X2),X3)
      | contains_slb(X1,X3) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f190,plain,
    ! [X0,X1] : create_pq = i(triple(X0,create_slb,X1)),
    inference(cnf_transformation,[],[f54]) ).

fof(f192,plain,
    ( contains_cpq(triple(sK1,create_slb,sK2),sK3)
    | contains_pq(i(triple(sK1,create_slb,sK2)),sK3) ),
    inference(cnf_transformation,[],[f126]) ).

tcf(c_56,plain,
    ! [X0: $i] : ~ contains_pq(create_pq,X0),
    inference(cnf_transformation,[],[f134]) ).

tcf(c_71,plain,
    ! [X0: $i] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[],[f149]) ).

tcf(c_97,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( contains_slb(X1,X3)
      | ~ contains_cpq(triple(X0,X1,X2),X3) ),
    inference(cnf_transformation,[],[f174]) ).

tcf(c_110,plain,
    ! [X0: $i,X1: $i] : i(triple(X0,create_slb,X1)) = create_pq,
    inference(cnf_transformation,[],[f190]) ).

tcf(c_113,negated_conjecture,
    ( contains_cpq(triple(sK1,create_slb,sK2),sK3)
    | contains_pq(i(triple(sK1,create_slb,sK2)),sK3) ),
    inference(cnf_transformation,[],[f192]) ).

tcf(c_169,plain,
    ( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
    | contains_cpq(triple(sK1,create_slb,sK2),sK3) ),
    inference(prop_impl_just,[status(thm)],[c_113]) ).

tcf(c_170,plain,
    ( contains_cpq(triple(sK1,create_slb,sK2),sK3)
    | contains_pq(i(triple(sK1,create_slb,sK2)),sK3) ),
    inference(renaming,[status(thm)],[c_169]) ).

tcf(c_652,plain,
    ( contains_pq(create_pq,sK3)
    | contains_cpq(triple(sK1,create_slb,sK2),sK3) ),
    inference(demodulation,[status(thm)],[c_170,c_110]) ).

tcf(c_653,plain,
    contains_cpq(triple(sK1,create_slb,sK2),sK3),
    inference(forward_subsumption_resolution,[status(thm)],[c_652,c_56]) ).

tcf(c_2350,plain,
    contains_slb(create_slb,sK3),
    inference(superposition,[status(thm)],[c_653,c_97]) ).

tcf(c_2352,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2350,c_71]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV369+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/15.39  % Computer : n026.cluster.edu
% 0.10/15.39  % Model    : x86_64 x86_64
% 0.10/15.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.39  % Memory   : 8046.5625MB
% 0.10/15.39  % OS       : Linux 6.8.0-71-generic
% 0.10/15.39  % CPULimit : 300
% 0.10/15.39  % WCLimit  : 300
% 0.10/15.39  % DateTime : Thu Sep 24 19:26:40 UTC 2026
% 0.15/15.40  % CPUTime  : 
% 0.15/15.40  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/15.43  Running first-order theorem proving
% 0.15/15.43  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/15.44  
% 0.15/15.44  % ======== iProver multi-core TPTP/SMT =========
% 0.15/15.44  
% 0.15/15.44  % Detected problem language: tptp
% 0.15/15.45  % Proving...
% 3.88/16.30  % SZS status Started for theBenchmark.p
% 3.88/16.30  % SZS status Theorem for theBenchmark.p
% 3.88/16.30  
% 3.88/16.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.88/16.30  
% 3.88/16.30  % ------  iProver source info
% 3.88/16.30  
% 3.88/16.30  % git: date: 2026-07-19 20:42:38 +0200
% 3.88/16.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.88/16.30  % git: non_committed_changes: false
% 3.88/16.30  
% 3.88/16.30  % ------ Parsing...
% 3.88/16.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.88/16.30  
% 3.88/16.30  % ------ Preprocessing... sup_sim: 2  sf_s  rm: 7 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 5 0s  sf_e  pe_s  pe_e % 
% 3.88/16.30  
% 3.88/16.30  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.88/16.30  
% 3.88/16.30  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.88/16.30  % ------ Proving...
% 3.88/16.30  % ------ Problem Properties 
% 3.88/16.30  
% 3.88/16.30  % 
% 3.88/16.30  % clauses                               56
% 3.88/16.30  % conjectures                           0
% 3.88/16.30  % EPR                                   7
% 3.88/16.30  % Horn                                  39
% 3.88/16.30  % unary                                 23
% 3.88/16.30  % binary                                15
% 3.88/16.30  % lits                                  108
% 3.88/16.30  % lits eq                               40
% 3.88/16.30  % fd_pure                               0
% 3.88/16.30  % fd_pseudo                             0
% 3.88/16.30  % fd_cond                               5
% 3.88/16.30  % fd_pseudo_cond                        7
% 3.88/16.30  % AC symbols                            0
% 3.88/16.30  
% 3.88/16.30  % ------ Schedule dynamic 5 is on 
% 3.88/16.30  
% 3.88/16.30  % ------ no conjectures: strip conj schedule 
% 3.88/16.30  
% 3.88/16.30  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.88/16.30  
% 3.88/16.30  
% 3.88/16.30  % ------ 
% 3.88/16.30  % Current options:
% 3.88/16.30  % ------ 
% 3.88/16.30  
% 3.88/16.30  
% 3.88/16.30  % 
% 3.88/16.30  
% 3.88/16.30  % ------ Proving...
% 3.88/16.30  % 
% 3.88/16.30  
% 3.88/16.30  % SZS status Theorem for theBenchmark.p
% 3.88/16.30  
% 3.88/16.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.88/16.30  
% 3.88/16.30  
%------------------------------------------------------------------------------