↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n008.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:07:29 PM UTC 2026

% Result   : Unsatisfiable 3.67s 11.30s
% Output   : CNFRefutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   32 (  22 unt;   1 def)
%            Number of atoms       :   74 (  27 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   68 (  38   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  19   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

fof(f73,axiom,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk1
      | app(app(X0,X1),X2) != sk2
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f209,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f208]) ).

fof(f216,plain,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk3
      | app(app(X0,X1),X2) != sk4
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f206,f204,f205]) ).

tcf(c_253,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_318,plain,
    ! [X0: $i] :
      ( ( app(X0,nil) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f73]) ).

tcf(c_433,negated_conjecture,
    ssList(sk3),
    inference(cnf_transformation,[],[f202]) ).

tcf(c_434,negated_conjecture,
    ssList(sk4),
    inference(cnf_transformation,[],[f203]) ).

tcf(c_435,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(cnf_transformation,[],[f216]) ).

tcf(c_436,negated_conjecture,
    ssList(sk5),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_437,negated_conjecture,
    app(sk3,sk5) = sk4,
    inference(cnf_transformation,[],[f209]) ).

tcf(c_6541,definition,
    iPr_def_12 = app(sk3,sk5),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6542,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(demodulation,[status(thm)],[c_435]) ).

tcf(c_6546,negated_conjecture,
    iPr_def_12 = sk4,
    inference(demodulation,[status(thm)],[c_437,c_6541]) ).

tcf(c_6547,negated_conjecture,
    ssList(sk5),
    inference(demodulation,[status(thm)],[c_436]) ).

tcf(c_6548,negated_conjecture,
    ssList(sk4),
    inference(demodulation,[status(thm)],[c_434]) ).

tcf(c_6549,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_433]) ).

tcf(c_9094,plain,
    ssList(iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_6548,c_6546]) ).

tcf(c_9098,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != iPr_def_12 ) ),
    inference(light_normalisation,[status(thm)],[c_6542,c_6546]) ).

tcf(c_9154,plain,
    ! [X0: $i] :
      ( ~ ssList(sk5)
      | ~ ssList(sk3)
      | ~ ssList(X0)
      | ( app(iPr_def_12,X0) != iPr_def_12 )
      | ( app(sk3,X0) != sk3 ) ),
    inference(superposition,[status(thm)],[c_6541,c_9098]) ).

tcf(c_9155,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( app(iPr_def_12,X0) != iPr_def_12 )
      | ( app(sk3,X0) != sk3 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9154,c_6547,c_6549]) ).

tcf(c_9159,plain,
    ( ~ ssList(nil)
    | ( app(iPr_def_12,nil) != iPr_def_12 )
    | ( app(sk3,nil) != sk3 ) ),
    inference(instantiation,[status(thm)],[c_9155]) ).

tcf(c_9378,plain,
    app(sk3,nil) = sk3,
    inference(superposition,[status(thm)],[c_6549,c_318]) ).

tcf(c_9408,plain,
    app(iPr_def_12,nil) = iPr_def_12,
    inference(superposition,[status(thm)],[c_9094,c_318]) ).

tcf(c_9409,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_9378,c_9408,c_9159,c_253]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC009-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/10.39  % Computer : n008.cluster.edu
% 0.12/10.39  % Model    : x86_64 x86_64
% 0.12/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39  % Memory   : 8046.5625MB
% 0.12/10.39  % OS       : Linux 6.8.0-71-generic
% 0.12/10.39  % CPULimit : 300
% 0.12/10.39  % WCLimit  : 300
% 0.12/10.39  % DateTime : Thu Sep 24 15:54:06 UTC 2026
% 0.12/10.39  % CPUTime  : 
% 0.12/10.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.43  Running first-order theorem proving
% 0.15/10.43  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/10.44  
% 0.15/10.44  % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44  
% 0.15/10.44  % Detected problem language: tptp
% 0.15/10.46  % Proving...
% 3.67/11.30  % SZS status Started for theBenchmark.p
% 3.67/11.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.67/11.30  
% 3.67/11.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.67/11.30  
% 3.67/11.30  % ------  iProver source info
% 3.67/11.30  
% 3.67/11.30  % git: date: 2026-07-19 20:42:38 +0200
% 3.67/11.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.67/11.30  % git: non_committed_changes: false
% 3.67/11.30  
% 3.67/11.30  % ------ Parsing...% successful
% 3.67/11.30  
% 3.67/11.30  
% 3.67/11.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.67/11.30  
% 3.67/11.30  % ------ 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.67/11.30  
% 3.67/11.30  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.67/11.30  
% 3.67/11.30  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.67/11.30  % ------ Proving...
% 3.67/11.30  % ------ Problem Properties 
% 3.67/11.30  
% 3.67/11.30  % 
% 3.67/11.30  % clauses                               186
% 3.67/11.30  % conjectures                           8
% 3.67/11.30  % EPR                                   58
% 3.67/11.30  % Horn                                  158
% 3.67/11.30  % unary                                 64
% 3.67/11.30  % binary                                22
% 3.67/11.30  % lits                                  561
% 3.67/11.30  % lits eq                               77
% 3.67/11.30  % fd_pure                               0
% 3.67/11.30  % fd_pseudo                             0
% 3.67/11.30  % fd_cond                               15
% 3.67/11.30  % fd_pseudo_cond                        14
% 3.67/11.30  % AC symbols                            0
% 3.67/11.30  
% 3.67/11.30  % ------ Schedule dynamic 5 is on 
% 3.67/11.30  
% 3.67/11.30  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.67/11.30  
% 3.67/11.30  
% 3.67/11.30  % ------ 
% 3.67/11.30  % Current options:
% 3.67/11.30  % ------ 
% 3.67/11.30  
% 3.67/11.30  
% 3.67/11.30  % 
% 3.67/11.30  
% 3.67/11.30  % ------ Proving...
% 3.67/11.30  % 
% 3.67/11.30  
% 3.67/11.30  % SZS status Unsatisfiable for theBenchmark.p
% 3.67/11.30  
% 3.67/11.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.67/11.30  
% 3.67/11.30  
%------------------------------------------------------------------------------