↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n014.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:32:46 PM UTC 2026

% Result   : Theorem 2.20s 1.26s
% Output   : CNFRefutation 2.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   27 (  26 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   21 (  13   ~;   6   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn  37   !;   6   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] : nil != cons(X0,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).

fof(f6,axiom,
    ! [X0] : drop(s(X0),nil) = nil,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).

fof(f7,axiom,
    ! [X0,X1,X2] : drop(s(X0),cons(X1,X2)) = drop(X0,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).

fof(f9,conjecture,
    ? [X0,X1,X2] :
      ~ ( drop(X0,X1) = drop(X0,X2)
       => X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_009) ).

fof(f10,negated_conjecture,
    ~ ? [X0,X1,X2] :
        ~ ( drop(X0,X1) = drop(X0,X2)
         => X1 = X2 ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f11,plain,
    ! [X0,X1,X2] :
      ( drop(X0,X2) != drop(X0,X1)
      | X1 = X2 ),
    inference(ennf_transformation,[],[f10]) ).

fof(f14,plain,
    ! [X0,X1] : cons(X0,X1) != nil,
    inference(cnf_transformation,[],[f3]) ).

fof(f17,plain,
    ! [X0] : nil = drop(s(X0),nil),
    inference(cnf_transformation,[],[f6]) ).

fof(f18,plain,
    ! [X2,X0,X1] : drop(s(X0),cons(X1,X2)) = drop(X0,X2),
    inference(cnf_transformation,[],[f7]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( drop(X0,X2) != drop(X0,X1)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i] : cons(X0,X1) != nil,
    inference(cnf_transformation,[],[f14]) ).

tcf(c_54,plain,
    ! [X0: $i] : drop(s(X0),nil) = nil,
    inference(cnf_transformation,[],[f17]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i,X2: $i] : drop(s(X0),cons(X1,X2)) = drop(X0,X2),
    inference(cnf_transformation,[],[f18]) ).

tcf(c_57,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = X2 )
      | ( drop(X0,X1) != drop(X0,X2) ) ),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_95,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = X2 )
      | ( drop(X0,X1) != drop(X0,X2) ) ),
    inference(demodulation,[status(thm)],[c_57]) ).

tcf(c_159,plain,
    ! [X0: $i,X1: $i] :
      ( ( X1 = nil )
      | ( drop(s(X0),X1) != nil ) ),
    inference(superposition,[status(thm)],[c_54,c_95]) ).

tcf(c_170,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( cons(X2,X1) = nil )
      | ( drop(X0,X1) != nil ) ),
    inference(superposition,[status(thm)],[c_55,c_159]) ).

tcf(c_171,plain,
    ! [X0: $i,X1: $i] : drop(X0,X1) != nil,
    inference(forward_subsumption_resolution,[status(thm)],[c_170,c_51]) ).

tcf(c_174,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_54,c_171]) ).


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