↑ Up

iProver---3.9.4.THM-CRf.s

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

% Result   : Theorem 3.05s 1.08s
% Output   : CNFRefutation 3.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   42 (  42 unt;   5 def)
%            Number of atoms       :   70 (  41 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   6 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-3 aty)
%            Number of variables   :  104 (   0 sgn 100   !;   4   ?;  54   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f11,axiom,
    ! [X0,X1] : remove_pq(insert_pq(X0,X1),X1) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax11) ).

fof(f17,axiom,
    ! [X0,X1,X2] : insert_pq(insert_pq(X0,X1),X2) = insert_pq(insert_pq(X0,X2),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax17) ).

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/Axioms/SWV007+3.ax',ax42) ).

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/Axioms/SWV007+4.ax',ax55) ).

fof(f63,axiom,
    ! [X0,X1,X2,X3,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main2_l12) ).

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

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

fof(f116,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(f126,plain,
    insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4)],[f116]) ).

fof(f140,plain,
    ! [X0,X1] : remove_pq(insert_pq(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f11]) ).

fof(f146,plain,
    ! [X2,X0,X1] : insert_pq(insert_pq(X0,X1),X2) = insert_pq(insert_pq(X0,X2),X1),
    inference(cnf_transformation,[],[f17]) ).

fof(f178,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(f191,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(f192,plain,
    ! [X2,X3,X0,X1,X4] : i(triple(X0,X2,X3)) = i(triple(X1,X2,X4)),
    inference(cnf_transformation,[],[f63]) ).

fof(f193,plain,
    insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
    inference(cnf_transformation,[],[f126]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i] : remove_pq(insert_pq(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f140]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i,X2: $i] : insert_pq(insert_pq(X0,X1),X2) = insert_pq(insert_pq(X0,X2),X1),
    inference(cnf_transformation,[],[f146]) ).

tcf(c_100,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,[],[f178]) ).

tcf(c_111,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2),
    inference(cnf_transformation,[],[f191]) ).

tcf(c_112,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : i(triple(X0,X1,X2)) = i(triple(X3,X1,X4)),
    inference(cnf_transformation,[],[f192]) ).

tcf(c_113,negated_conjecture,
    insert_pq(i(triple(sK1,sK2,sK3)),sK4) != i(insert_cpq(triple(sK1,sK2,sK3),sK4)),
    inference(cnf_transformation,[],[f193]) ).

tcf(c_1381,definition,
    iPr_def_10 = triple(sK1,sK2,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_1382,definition,
    iPr_def_11 = i(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_1383,definition,
    iPr_def_12 = insert_pq(iPr_def_11,sK4),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_1384,definition,
    iPr_def_13 = insert_cpq(iPr_def_10,sK4),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_1385,definition,
    iPr_def_14 = i(iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_1386,negated_conjecture,
    iPr_def_12 != iPr_def_14,
    inference(demodulation,[status(thm)],[c_113,c_1384,c_1385,c_1381,c_1382,c_1383]) ).

tcf(c_2217,plain,
    ! [X0: $i] : insert_pq(insert_pq(iPr_def_11,X0),sK4) = insert_pq(iPr_def_12,X0),
    inference(superposition,[status(thm)],[c_1383,c_68]) ).

tcf(c_2264,plain,
    ! [X0: $i,X1: $i] : i(triple(X0,sK2,X1)) = i(iPr_def_10),
    inference(superposition,[status(thm)],[c_1381,c_112]) ).

tcf(c_2271,plain,
    ! [X0: $i,X1: $i] : i(triple(X0,sK2,X1)) = iPr_def_11,
    inference(light_normalisation,[status(thm)],[c_2264,c_1382]) ).

tcf(c_2303,plain,
    ! [X0: $i] : remove_pq(insert_pq(iPr_def_12,X0),sK4) = insert_pq(iPr_def_11,X0),
    inference(superposition,[status(thm)],[c_2217,c_62]) ).

tcf(c_2367,plain,
    insert_pq(iPr_def_11,sK4) = iPr_def_12,
    inference(superposition,[status(thm)],[c_62,c_2303]) ).

tcf(c_2849,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : i(triple(X0,insert_slb(X1,pair(X2,bottom)),X3)) = i(insert_cpq(triple(X4,X1,X5),X2)),
    inference(superposition,[status(thm)],[c_100,c_112]) ).

tcf(c_3004,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] : i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X5,X1,X6)),X2),
    inference(superposition,[status(thm)],[c_111,c_112]) ).

tcf(c_5684,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : i(insert_cpq(triple(X0,X1,X2),X3)) = i(insert_cpq(triple(X4,X1,X5),X3)),
    inference(superposition,[status(thm)],[c_2849,c_2849]) ).

tcf(c_7080,plain,
    ! [X0: $i,X1: $i,X2: $i] : i(insert_cpq(triple(X0,sK2,X1),X2)) = i(insert_cpq(iPr_def_10,X2)),
    inference(superposition,[status(thm)],[c_1381,c_5684]) ).

tcf(c_7097,plain,
    ! [X0: $i,X1: $i,X2: $i] : i(triple(X0,insert_slb(sK2,pair(X1,bottom)),X2)) = i(insert_cpq(iPr_def_10,X1)),
    inference(superposition,[status(thm)],[c_7080,c_2849]) ).

tcf(c_7505,plain,
    ! [X0: $i,X1: $i,X2: $i] : insert_pq(i(triple(X0,sK2,X1)),X2) = i(insert_cpq(iPr_def_10,X2)),
    inference(superposition,[status(thm)],[c_3004,c_7097]) ).

tcf(c_7545,plain,
    ! [X0: $i] : i(insert_cpq(iPr_def_10,X0)) = insert_pq(iPr_def_11,X0),
    inference(light_normalisation,[status(thm)],[c_7505,c_2271]) ).

tcf(c_8080,plain,
    insert_pq(iPr_def_11,sK4) = i(iPr_def_13),
    inference(superposition,[status(thm)],[c_1384,c_7545]) ).

tcf(c_8081,plain,
    iPr_def_12 = iPr_def_14,
    inference(light_normalisation,[status(thm)],[c_8080,c_1385,c_2367]) ).

tcf(c_8082,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_8081,c_1386]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV415+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n010.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 19:31:43 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.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.42  % Proving...
% 3.05/1.08  % SZS status Started for theBenchmark.p
% 3.05/1.08  % SZS status Theorem for theBenchmark.p
% 3.05/1.08  
% 3.05/1.08  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.05/1.08  
% 3.05/1.08  % ------  iProver source info
% 3.05/1.08  
% 3.05/1.08  % git: date: 2026-07-19 20:42:38 +0200
% 3.05/1.08  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.05/1.08  % git: non_committed_changes: false
% 3.05/1.08  
% 3.05/1.08  % ------ Parsing...
% 3.05/1.08  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.05/1.08  
% 3.05/1.08  % ------ 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: 5 0s  sf_e  pe_s  pe_e % 
% 3.05/1.08  
% 3.05/1.08  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.05/1.08  
% 3.05/1.08  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.05/1.08  % ------ Proving...
% 3.05/1.08  % ------ Problem Properties 
% 3.05/1.08  
% 3.05/1.08  % 
% 3.05/1.08  % clauses                               62
% 3.05/1.08  % conjectures                           1
% 3.05/1.08  % EPR                                   8
% 3.05/1.08  % Horn                                  45
% 3.05/1.08  % unary                                 29
% 3.05/1.08  % binary                                15
% 3.05/1.08  % lits                                  114
% 3.05/1.08  % lits eq                               47
% 3.05/1.08  % fd_pure                               0
% 3.05/1.08  % fd_pseudo                             0
% 3.05/1.08  % fd_cond                               5
% 3.05/1.08  % fd_pseudo_cond                        7
% 3.05/1.08  % AC symbols                            0
% 3.05/1.08  
% 3.05/1.08  % ------ Schedule dynamic 5 is on 
% 3.05/1.08  
% 3.05/1.08  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.05/1.08  
% 3.05/1.08  
% 3.05/1.08  % ------ 
% 3.05/1.08  % Current options:
% 3.05/1.08  % ------ 
% 3.05/1.08  
% 3.05/1.08  
% 3.05/1.08  % 
% 3.05/1.08  
% 3.05/1.08  % ------ Proving...
% 3.05/1.08  % 
% 3.05/1.08  
% 3.05/1.08  % SZS status Theorem for theBenchmark.p
% 3.05/1.08  
% 3.05/1.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.05/1.08  
% 3.05/1.08  
%------------------------------------------------------------------------------