TSTP Solution File: SWV415+2 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SWV415+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May  3 03:14:22 EDT 2024

% Result   : Theorem 7.93s 1.69s
% Output   : CNFRefutation 7.93s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named definition)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,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/sandbox/benchmark/theBenchmark.p',ax42) ).

fof(f54,axiom,
    ! [X0,X1] : create_pq = i(triple(X0,create_slb,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax54) ).

fof(f55,axiom,
    ! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).

fof(f63,axiom,
    ( ( ! [X4] :
          ( ! [X5,X6,X7,X8] : i(triple(X5,X4,X7)) = i(triple(X6,X4,X8))
         => ! [X9,X10,X11,X12,X13,X14] : i(triple(X9,insert_slb(X4,pair(X13,X14)),X11)) = i(triple(X10,insert_slb(X4,pair(X13,X14)),X12)) )
      & ! [X0,X1,X2,X3] : i(triple(X0,create_slb,X2)) = i(triple(X1,create_slb,X3)) )
   => ! [X15,X16,X17,X18,X19] : i(triple(X15,X17,X18)) = i(triple(X16,X17,X19)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',big2_induction) ).

fof(f64,conjecture,
    ! [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) = i(insert_cpq(triple(X0,X1,X2),X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co2) ).

fof(f65,negated_conjecture,
    ~ ! [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) = i(insert_cpq(triple(X0,X1,X2),X3)),
    inference(negated_conjecture,[],[f64]) ).

fof(f74,plain,
    ( ( ! [X0] :
          ( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
         => ! [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) = i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) )
      & ! [X11,X12,X13,X14] : i(triple(X11,create_slb,X13)) = i(triple(X12,create_slb,X14)) )
   => ! [X15,X16,X17,X18,X19] : i(triple(X15,X17,X18)) = i(triple(X16,X17,X19)) ),
    inference(rectify,[],[f63]) ).

fof(f117,plain,
    ( ! [X15,X16,X17,X18,X19] : i(triple(X15,X17,X18)) = i(triple(X16,X17,X19))
    | ? [X0] :
        ( ? [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) != i(triple(X6,insert_slb(X0,pair(X9,X10)),X8))
        & ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4)) )
    | ? [X11,X12,X13,X14] : i(triple(X11,create_slb,X13)) != i(triple(X12,create_slb,X14)) ),
    inference(ennf_transformation,[],[f74]) ).

fof(f118,plain,
    ( ! [X15,X16,X17,X18,X19] : i(triple(X15,X17,X18)) = i(triple(X16,X17,X19))
    | ? [X0] :
        ( ? [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) != i(triple(X6,insert_slb(X0,pair(X9,X10)),X8))
        & ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4)) )
    | ? [X11,X12,X13,X14] : i(triple(X11,create_slb,X13)) != i(triple(X12,create_slb,X14)) ),
    inference(flattening,[],[f117]) ).

fof(f119,plain,
    ? [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) != i(insert_cpq(triple(X0,X1,X2),X3)),
    inference(ennf_transformation,[],[f65]) ).

fof(f130,plain,
    ( ! [X0,X1,X2,X3,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4))
    | ? [X5] :
        ( ? [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X5,pair(X10,X11)),X8)) != i(triple(X7,insert_slb(X5,pair(X10,X11)),X9))
        & ! [X12,X13,X14,X15] : i(triple(X12,X5,X14)) = i(triple(X13,X5,X15)) )
    | ? [X16,X17,X18,X19] : i(triple(X16,create_slb,X18)) != i(triple(X17,create_slb,X19)) ),
    inference(rectify,[],[f118]) ).

fof(f131,plain,
    ( ? [X5] :
        ( ? [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X5,pair(X10,X11)),X8)) != i(triple(X7,insert_slb(X5,pair(X10,X11)),X9))
        & ! [X12,X13,X14,X15] : i(triple(X12,X5,X14)) = i(triple(X13,X5,X15)) )
   => ( ? [X11,X10,X9,X8,X7,X6] : i(triple(X6,insert_slb(sK1,pair(X10,X11)),X8)) != i(triple(X7,insert_slb(sK1,pair(X10,X11)),X9))
      & ! [X15,X14,X13,X12] : i(triple(X12,sK1,X14)) = i(triple(X13,sK1,X15)) ) ),
    introduced(choice_axiom,[]) ).

fof(f132,plain,
    ( ? [X11,X10,X9,X8,X7,X6] : i(triple(X6,insert_slb(sK1,pair(X10,X11)),X8)) != i(triple(X7,insert_slb(sK1,pair(X10,X11)),X9))
   => i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5)) ),
    introduced(choice_axiom,[]) ).

fof(f133,plain,
    ( ? [X16,X17,X18,X19] : i(triple(X16,create_slb,X18)) != i(triple(X17,create_slb,X19))
   => i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11)) ),
    introduced(choice_axiom,[]) ).

fof(f134,plain,
    ( ! [X0,X1,X2,X3,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4))
    | ( i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5))
      & ! [X12,X13,X14,X15] : i(triple(X12,sK1,X14)) = i(triple(X13,sK1,X15)) )
    | i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f130,f133,f132,f131]) ).

fof(f135,plain,
    ( ? [X0,X1,X2,X3] : insert_pq(i(triple(X0,X1,X2)),X3) != i(insert_cpq(triple(X0,X1,X2),X3))
   => insert_pq(i(triple(sK12,sK13,sK14)),sK15) != i(insert_cpq(triple(sK12,sK13,sK14),sK15)) ),
    introduced(choice_axiom,[]) ).

fof(f136,plain,
    insert_pq(i(triple(sK12,sK13,sK14)),sK15) != i(insert_cpq(triple(sK12,sK13,sK14),sK15)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15])],[f119,f135]) ).

fof(f188,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,[],[f42]) ).

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

fof(f201,plain,
    ! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    inference(cnf_transformation,[],[f55]) ).

fof(f202,plain,
    ! [X2,X3,X0,X1,X14,X4,X15,X12,X13] :
      ( i(triple(X0,X2,X3)) = i(triple(X1,X2,X4))
      | i(triple(X12,sK1,X14)) = i(triple(X13,sK1,X15))
      | i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11)) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f203,plain,
    ! [X2,X3,X0,X1,X4] :
      ( i(triple(X0,X2,X3)) = i(triple(X1,X2,X4))
      | i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5))
      | i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11)) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f204,plain,
    insert_pq(i(triple(sK12,sK13,sK14)),sK15) != i(insert_cpq(triple(sK12,sK13,sK14),sK15)),
    inference(cnf_transformation,[],[f136]) ).

cnf(c_100,plain,
    triple(insert_pqp(X0,X1),insert_slb(X2,pair(X1,bottom)),X3) = insert_cpq(triple(X0,X2,X3),X1),
    inference(cnf_transformation,[],[f188]) ).

cnf(c_110,plain,
    i(triple(X0,create_slb,X1)) = create_pq,
    inference(cnf_transformation,[],[f200]) ).

cnf(c_111,plain,
    i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2),
    inference(cnf_transformation,[],[f201]) ).

cnf(c_112,plain,
    ( i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5))
    | i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11))
    | i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)) ),
    inference(cnf_transformation,[],[f203]) ).

cnf(c_113,plain,
    ( i(triple(sK8,create_slb,sK10)) != i(triple(sK9,create_slb,sK11))
    | i(triple(X0,X1,X2)) = i(triple(X3,X1,X4))
    | i(triple(X5,sK1,X6)) = i(triple(X7,sK1,X8)) ),
    inference(cnf_transformation,[],[f202]) ).

cnf(c_114,negated_conjecture,
    insert_pq(i(triple(sK12,sK13,sK14)),sK15) != i(insert_cpq(triple(sK12,sK13,sK14),sK15)),
    inference(cnf_transformation,[],[f204]) ).

cnf(c_616,plain,
    ( create_pq != create_pq
    | i(triple(X0,X1,X2)) = i(triple(X3,X1,X4))
    | i(triple(X5,sK1,X6)) = i(triple(X7,sK1,X8)) ),
    inference(demodulation,[status(thm)],[c_113,c_110]) ).

cnf(c_617,plain,
    ( i(triple(X0,X1,X2)) = i(triple(X3,X1,X4))
    | i(triple(X5,sK1,X6)) = i(triple(X7,sK1,X8)) ),
    inference(equality_resolution_simp,[status(thm)],[c_616]) ).

cnf(c_622,plain,
    ( insert_pq(i(triple(sK2,sK1,sK4)),sK6) != insert_pq(i(triple(sK3,sK1,sK5)),sK6)
    | create_pq != create_pq
    | i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)) ),
    inference(demodulation,[status(thm)],[c_112,c_110,c_111]) ).

cnf(c_623,plain,
    ( insert_pq(i(triple(sK2,sK1,sK4)),sK6) != insert_pq(i(triple(sK3,sK1,sK5)),sK6)
    | i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)) ),
    inference(equality_resolution_simp,[status(thm)],[c_622]) ).

cnf(c_1421,plain,
    ( i(triple(X0,sK1,X1)) = i(triple(X2,sK1,X3))
    | ~ sP0_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_617]) ).

cnf(c_1422,plain,
    ( i(triple(X0,X1,X2)) = i(triple(X3,X1,X4))
    | ~ sP1_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_617]) ).

cnf(c_1423,plain,
    ( sP0_iProver_def
    | sP1_iProver_def ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_617]) ).

cnf(c_1424,plain,
    triple(sK12,sK13,sK14) = sP2_iProver_def,
    definition ).

cnf(c_1425,plain,
    i(sP2_iProver_def) = sP3_iProver_def,
    definition ).

cnf(c_1426,plain,
    insert_pq(sP3_iProver_def,sK15) = sP4_iProver_def,
    definition ).

cnf(c_1427,plain,
    insert_cpq(sP2_iProver_def,sK15) = sP5_iProver_def,
    definition ).

cnf(c_1428,plain,
    i(sP5_iProver_def) = sP6_iProver_def,
    definition ).

cnf(c_1429,negated_conjecture,
    sP4_iProver_def != sP6_iProver_def,
    inference(demodulation,[status(thm)],[c_114,c_1427,c_1428,c_1424,c_1425,c_1426]) ).

cnf(c_3107,plain,
    insert_pq(i(triple(insert_pqp(X0,X1),X2,X3)),X1) = i(insert_cpq(triple(X0,X2,X3),X1)),
    inference(superposition,[status(thm)],[c_100,c_111]) ).

cnf(c_3538,plain,
    ( i(triple(X0,X1,X2)) = i(triple(X3,X1,X4))
    | sP0_iProver_def ),
    inference(superposition,[status(thm)],[c_1423,c_1422]) ).

cnf(c_3546,plain,
    i(triple(X0,sK1,X1)) = i(triple(X2,sK1,X3)),
    inference(backward_subsumption_resolution,[status(thm)],[c_1421,c_3538]) ).

cnf(c_6920,plain,
    insert_pq(i(triple(X0,sK1,X1)),X2) = i(insert_cpq(triple(X3,sK1,X4),X2)),
    inference(superposition,[status(thm)],[c_3546,c_3107]) ).

cnf(c_10549,plain,
    insert_pq(i(triple(X0,sK1,X1)),X2) = insert_pq(i(triple(X3,sK1,X4)),X2),
    inference(superposition,[status(thm)],[c_6920,c_6920]) ).

cnf(c_10584,plain,
    i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)),
    inference(backward_subsumption_resolution,[status(thm)],[c_623,c_10549]) ).

cnf(c_10694,plain,
    i(triple(X0,sK13,X1)) = i(sP2_iProver_def),
    inference(superposition,[status(thm)],[c_1424,c_10584]) ).

cnf(c_10706,plain,
    insert_pq(i(triple(X0,X1,X2)),X3) = i(insert_cpq(triple(X4,X1,X5),X3)),
    inference(superposition,[status(thm)],[c_10584,c_3107]) ).

cnf(c_10707,plain,
    i(triple(X0,sK13,X1)) = sP3_iProver_def,
    inference(light_normalisation,[status(thm)],[c_10694,c_1425]) ).

cnf(c_12358,plain,
    i(insert_cpq(triple(X0,sK13,X1),X2)) = insert_pq(sP3_iProver_def,X2),
    inference(superposition,[status(thm)],[c_10707,c_10706]) ).

cnf(c_12529,plain,
    i(insert_cpq(sP2_iProver_def,X0)) = insert_pq(sP3_iProver_def,X0),
    inference(superposition,[status(thm)],[c_1424,c_12358]) ).

cnf(c_12573,plain,
    insert_pq(sP3_iProver_def,sK15) = i(sP5_iProver_def),
    inference(superposition,[status(thm)],[c_1427,c_12529]) ).

cnf(c_12574,plain,
    sP4_iProver_def = sP6_iProver_def,
    inference(light_normalisation,[status(thm)],[c_12573,c_1426,c_1428]) ).

cnf(c_12575,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12574,c_1429]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV415+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13  % Command  : run_iprover %s %d THM
% 0.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Fri May  3 00:13:12 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.93/1.69  % SZS status Started for theBenchmark.p
% 7.93/1.69  % SZS status Theorem for theBenchmark.p
% 7.93/1.69  
% 7.93/1.69  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.93/1.69  
% 7.93/1.69  ------  iProver source info
% 7.93/1.69  
% 7.93/1.69  git: date: 2024-05-02 19:28:25 +0000
% 7.93/1.69  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.93/1.69  git: non_committed_changes: false
% 7.93/1.69  
% 7.93/1.69  ------ Parsing...
% 7.93/1.69  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 7.93/1.69  
% 7.93/1.69  ------ 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 
% 7.93/1.69  
% 7.93/1.69  ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 7.93/1.69  
% 7.93/1.69  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 7.93/1.69  ------ Proving...
% 7.93/1.69  ------ Problem Properties 
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  clauses                                 65
% 7.93/1.69  conjectures                             1
% 7.93/1.69  EPR                                     9
% 7.93/1.69  Horn                                    47
% 7.93/1.69  unary                                   28
% 7.93/1.69  binary                                  19
% 7.93/1.69  lits                                    121
% 7.93/1.69  lits eq                                 50
% 7.93/1.69  fd_pure                                 0
% 7.93/1.69  fd_pseudo                               0
% 7.93/1.69  fd_cond                                 5
% 7.93/1.69  fd_pseudo_cond                          7
% 7.93/1.69  AC symbols                              0
% 7.93/1.69  
% 7.93/1.69  ------ Schedule dynamic 5 is on 
% 7.93/1.69  
% 7.93/1.69  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  ------ 
% 7.93/1.69  Current options:
% 7.93/1.69  ------ 
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  ------ Proving...
% 7.93/1.69  
% 7.93/1.69  
% 7.93/1.69  % SZS status Theorem for theBenchmark.p
% 7.93/1.69  
% 7.93/1.69  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.93/1.69  
% 7.93/1.70  
%------------------------------------------------------------------------------