↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC039-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 : n019.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:38 PM UTC 2026

% Result   : Unsatisfiable 1.56s 1.29s
% Output   : CNFRefutation 1.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   38 (  14 unt;   0 def)
%            Number of atoms       :   83 (  43 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   83 (  38   ~;  45   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn  20   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).

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

fof(f122,plain,
    ! [X0,X1] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ ssList(X1)
      | nil != app(X0,X1) ),
    inference(reorient_equations,[],[f121]) ).

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

fof(f124,plain,
    ! [X0,X1] :
      ( nil = X1
      | ~ ssList(X0)
      | ~ ssList(X1)
      | nil != app(X0,X1) ),
    inference(reorient_equations,[],[f123]) ).

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

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

fof(f205,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    nil != sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f218,negated_conjecture,
    ( nil = sk3
    | ssList(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

fof(f219,negated_conjecture,
    ( nil = sk3
    | ssList(sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

fof(f222,negated_conjecture,
    ( nil = sk3
    | app(app(sk6,sk3),sk7) = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).

fof(f223,plain,
    ( nil = sk3
    | sk4 = app(app(sk6,sk3),sk7) ),
    inference(reorient_equations,[],[f222]) ).

fof(f226,plain,
    nil = sk4,
    inference(definition_unfolding,[],[f204,f205]) ).

fof(f229,plain,
    sk3 != sk4,
    inference(definition_unfolding,[],[f207,f226,f206]) ).

fof(f238,plain,
    ( sk3 = sk4
    | ssList(sk6) ),
    inference(definition_unfolding,[],[f218,f226]) ).

fof(f239,plain,
    ( sk3 = sk4
    | ssList(sk7) ),
    inference(definition_unfolding,[],[f219,f226]) ).

fof(f241,plain,
    ( sk3 = sk4
    | sk4 = app(app(sk6,sk3),sk7) ),
    inference(definition_unfolding,[],[f223,f226]) ).

fof(f248,plain,
    ! [X0,X1] :
      ( sk4 = X1
      | ~ ssList(X0)
      | ~ ssList(X1)
      | app(X0,X1) != sk4 ),
    inference(definition_unfolding,[],[f124,f226,f226]) ).

fof(f249,plain,
    ! [X0,X1] :
      ( sk4 = X0
      | ~ ssList(X0)
      | ~ ssList(X1)
      | app(X0,X1) != sk4 ),
    inference(definition_unfolding,[],[f122,f226,f226]) ).

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

tcf(c_260,negated_conjecture,
    sk3 != sk4,
    inference(cnf_transformation,[],[f229]) ).

tcf(c_262,negated_conjecture,
    ( ssList(sk6)
    | ( sk3 = sk4 ) ),
    inference(cnf_transformation,[],[f238]) ).

tcf(c_263,negated_conjecture,
    ( ssList(sk7)
    | ( sk3 = sk4 ) ),
    inference(cnf_transformation,[],[f239]) ).

tcf(c_265,negated_conjecture,
    ( ( sk3 = sk4 )
    | ( app(app(sk6,sk3),sk7) = sk4 ) ),
    inference(cnf_transformation,[],[f241]) ).

tcf(c_280,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( X1 = sk4 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X1) != sk4 ) ),
    inference(cnf_transformation,[],[f248]) ).

tcf(c_281,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ( X0 = sk4 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X1) != sk4 ) ),
    inference(cnf_transformation,[],[f249]) ).

tcf(c_282,plain,
    ! [X0: $i,X1: $i] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f85]) ).

tcf(c_328,negated_conjecture,
    ssList(sk7),
    inference(global_subsumption_just,[status(thm)],[c_263,c_260,c_263]) ).

tcf(c_330,negated_conjecture,
    ssList(sk6),
    inference(global_subsumption_just,[status(thm)],[c_262,c_260,c_262]) ).

tcf(c_338,negated_conjecture,
    app(app(sk6,sk3),sk7) = sk4,
    inference(global_subsumption_just,[status(thm)],[c_265,c_260,c_265]) ).

tcf(c_2299,plain,
    ( ( app(sk6,sk3) = sk4 )
    | ~ ssList(sk7)
    | ~ ssList(app(sk6,sk3)) ),
    inference(superposition,[status(thm)],[c_338,c_281]) ).

tcf(c_2304,plain,
    ( ( app(sk6,sk3) = sk4 )
    | ~ ssList(app(sk6,sk3)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_2299,c_328]) ).

tcf(c_2501,plain,
    ( ( app(sk6,sk3) = sk4 )
    | ~ ssList(sk6)
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_282,c_2304]) ).

tcf(c_2502,plain,
    app(sk6,sk3) = sk4,
    inference(forward_subsumption_resolution,[status(thm)],[c_2501,c_330,c_258]) ).

tcf(c_2506,plain,
    ( ( sk3 = sk4 )
    | ~ ssList(sk6)
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_2502,c_280]) ).

tcf(c_2508,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2506,c_260,c_330,c_258]) ).


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