↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n013.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:08:35 PM UTC 2026

% Result   : Unsatisfiable 3.45s 1.18s
% Output   : CNFRefutation 3.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   40 (  28 unt;   5 def)
%            Number of atoms       :  114 (  37 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  101 (  53   ~;  48   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 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  :    9 (   7 usr;   6 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn  33   !;   0   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk3
      | X0 = X1
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,plain,
    ! [X2,X3,X0,X1] :
      ( sk3 != app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3)
      | X0 = X1
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(reorient_equations,[],[f206]) ).

fof(f208,negated_conjecture,
    ssItem(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f209,negated_conjecture,
    ssItem(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f210,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f211,negated_conjecture,
    ssList(sk8),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f212,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f213,plain,
    sk1 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(reorient_equations,[],[f212]) ).

fof(f214,negated_conjecture,
    sk5 != sk6,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f217,plain,
    sk3 = app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8),
    inference(definition_unfolding,[],[f213,f205]) ).

tcf(c_436,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X1 = X2 )
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | ( app(app(app(X0,cons(X1,nil)),cons(X2,nil)),X3) != sk3 ) ),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_437,negated_conjecture,
    ssItem(sk5),
    inference(cnf_transformation,[],[f208]) ).

tcf(c_438,negated_conjecture,
    ssItem(sk6),
    inference(cnf_transformation,[],[f209]) ).

tcf(c_439,negated_conjecture,
    ssList(sk7),
    inference(cnf_transformation,[],[f210]) ).

tcf(c_440,negated_conjecture,
    ssList(sk8),
    inference(cnf_transformation,[],[f211]) ).

tcf(c_441,negated_conjecture,
    app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
    inference(cnf_transformation,[],[f217]) ).

tcf(c_442,negated_conjecture,
    sk5 != sk6,
    inference(cnf_transformation,[],[f214]) ).

tcf(c_6491,definition,
    iPr_def_12 = cons(sk5,nil),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6492,definition,
    iPr_def_13 = app(sk7,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_6493,definition,
    iPr_def_14 = cons(sk6,nil),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_6494,definition,
    iPr_def_15 = app(iPr_def_13,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_6495,definition,
    iPr_def_16 = app(iPr_def_15,sk8),
    introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).

tcf(c_6496,negated_conjecture,
    iPr_def_16 = sk3,
    inference(demodulation,[status(thm)],[c_441,c_6493,c_6491,c_6492,c_6494,c_6495]) ).

tcf(c_6497,negated_conjecture,
    sk5 != sk6,
    inference(demodulation,[status(thm)],[c_442]) ).

tcf(c_6498,negated_conjecture,
    ssList(sk8),
    inference(demodulation,[status(thm)],[c_440]) ).

tcf(c_6499,negated_conjecture,
    ssList(sk7),
    inference(demodulation,[status(thm)],[c_439]) ).

tcf(c_6500,negated_conjecture,
    ssItem(sk6),
    inference(demodulation,[status(thm)],[c_438]) ).

tcf(c_6501,negated_conjecture,
    ssItem(sk5),
    inference(demodulation,[status(thm)],[c_437]) ).

tcf(c_6502,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X1 = X2 )
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | ( app(app(app(X0,cons(X1,nil)),cons(X2,nil)),X3) != sk3 ) ),
    inference(demodulation,[status(thm)],[c_436]) ).

tcf(c_9046,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X1 = X2 )
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | ~ ssList(X3)
      | ~ ssList(X0)
      | ( app(app(app(X0,cons(X1,nil)),cons(X2,nil)),X3) != iPr_def_16 ) ),
    inference(light_normalisation,[status(thm)],[c_6502,c_6496]) ).

tcf(c_9057,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = sk5 )
      | ~ ssItem(sk5)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ( app(app(app(X0,iPr_def_12),cons(X1,nil)),X2) != iPr_def_16 ) ),
    inference(superposition,[status(thm)],[c_6491,c_9046]) ).

tcf(c_9065,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = sk5 )
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ( app(app(app(X0,iPr_def_12),cons(X1,nil)),X2) != iPr_def_16 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9057,c_6501]) ).

tcf(c_9095,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = sk5 )
      | ~ ssList(sk7)
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | ( app(app(iPr_def_13,cons(X0,nil)),X1) != iPr_def_16 ) ),
    inference(superposition,[status(thm)],[c_6492,c_9065]) ).

tcf(c_9096,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = sk5 )
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | ( app(app(iPr_def_13,cons(X0,nil)),X1) != iPr_def_16 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9095,c_6499]) ).

tcf(c_9111,plain,
    ! [X0: $i] :
      ( ( sk5 = sk6 )
      | ~ ssItem(sk6)
      | ~ ssList(X0)
      | ( app(app(iPr_def_13,iPr_def_14),X0) != iPr_def_16 ) ),
    inference(superposition,[status(thm)],[c_6493,c_9096]) ).

tcf(c_9116,plain,
    ! [X0: $i] :
      ( ( sk5 = sk6 )
      | ~ ssItem(sk6)
      | ~ ssList(X0)
      | ( app(iPr_def_15,X0) != iPr_def_16 ) ),
    inference(light_normalisation,[status(thm)],[c_9111,c_6494]) ).

tcf(c_9117,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( app(iPr_def_15,X0) != iPr_def_16 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9116,c_6497,c_6500]) ).

tcf(c_9254,plain,
    ~ ssList(sk8),
    inference(superposition,[status(thm)],[c_6495,c_9117]) ).

tcf(c_9255,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_9254,c_6498]) ).


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