↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC331-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 : n007.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:09:20 PM UTC 2026

% Result   : Unsatisfiable 3.27s 11.24s
% Output   : CNFRefutation 3.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   32 (  16 unt;   0 def)
%            Number of atoms       :   68 (   9 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   76 (  40   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  21   !;   0   ?;  11   :)

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

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

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

fof(f187,axiom,
    ! [X2,X3,X0,X1] :
      ( segmentP(X3,X1)
      | ~ ssList(X3)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | app(app(X0,X1),X2) != X3 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).

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

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

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

fof(f206,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f213,negated_conjecture,
    ( ~ equalelemsP(sk1)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f216,plain,
    ( ~ equalelemsP(sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(definition_unfolding,[],[f213,f204,f205,f205]) ).

fof(f219,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

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

tcf(c_250,negated_conjecture,
    ssList(sk5),
    inference(cnf_transformation,[],[f206]) ).

tcf(c_251,negated_conjecture,
    app(sk3,sk5) = sk4,
    inference(cnf_transformation,[],[f208]) ).

tcf(c_252,negated_conjecture,
    equalelemsP(sk3),
    inference(cnf_transformation,[],[f209]) ).

tcf(c_254,negated_conjecture,
    ( ~ equalelemsP(sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(cnf_transformation,[],[f216]) ).

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

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

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

tcf(c_266,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(app(X0,X1),X2)) ),
    inference(cnf_transformation,[],[f219]) ).

tcf(c_285,negated_conjecture,
    ~ segmentP(sk4,sk3),
    inference(global_subsumption_just,[status(thm)],[c_254,c_252,c_254]) ).

tcf(c_1167,plain,
    app(nil,sk3) = sk3,
    inference(superposition,[status(thm)],[c_248,c_262]) ).

tcf(c_1829,plain,
    ! [X0: $i] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(nil)
      | ~ ssList(sk3)
      | ~ ssList(X0)
      | ~ ssList(app(app(nil,sk3),X0)) ),
    inference(superposition,[status(thm)],[c_1167,c_266]) ).

tcf(c_1889,plain,
    ! [X0: $i] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(nil)
      | ~ ssList(sk3)
      | ~ ssList(X0)
      | ~ ssList(app(sk3,X0)) ),
    inference(light_normalisation,[status(thm)],[c_1829,c_1167]) ).

tcf(c_1890,plain,
    ! [X0: $i] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(X0)
      | ~ ssList(app(sk3,X0)) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_1889,c_265,c_248]) ).

tcf(c_2232,plain,
    ! [X0: $i] :
      ( ssList(app(sk3,X0))
      | ~ ssList(sk3)
      | ~ ssList(X0) ),
    inference(instantiation,[status(thm)],[c_261]) ).

tcf(c_3561,plain,
    ! [X0: $i] :
      ( segmentP(app(sk3,X0),sk3)
      | ~ ssList(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_1890,c_248,c_1890,c_2232]) ).

tcf(c_3568,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk5) ),
    inference(superposition,[status(thm)],[c_251,c_3561]) ).

tcf(c_3573,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3568,c_285,c_250]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC331-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/10.39  % Computer : n007.cluster.edu
% 0.10/10.39  % Model    : x86_64 x86_64
% 0.10/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39  % Memory   : 8046.5625MB
% 0.10/10.39  % OS       : Linux 6.8.0-71-generic
% 0.10/10.40  % CPULimit : 300
% 0.10/10.40  % WCLimit  : 300
% 0.10/10.40  % DateTime : Thu Sep 24 17:38:04 UTC 2026
% 0.14/10.40  % CPUTime  : 
% 0.14/10.40  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.44  Running first-order theorem proving
% 0.14/10.44  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.14/10.45  
% 0.14/10.45  % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.45  
% 0.14/10.45  % Detected problem language: tptp
% 0.14/10.47  % Proving...
% 3.27/11.24  % SZS status Started for theBenchmark.p
% 3.27/11.24  % SZS status Unsatisfiable for theBenchmark.p
% 3.27/11.24  
% 3.27/11.24  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.27/11.24  
% 3.27/11.24  % ------  iProver source info
% 3.27/11.24  
% 3.27/11.24  % git: date: 2026-07-19 20:42:38 +0200
% 3.27/11.24  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.27/11.24  % git: non_committed_changes: false
% 3.27/11.24  
% 3.27/11.24  % ------ Parsing...% successful
% 3.27/11.24  
% 3.27/11.24  
% 3.27/11.24  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.27/11.24  
% 3.27/11.24  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e % 
% 3.27/11.24  
% 3.27/11.24  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.27/11.24  
% 3.27/11.24  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.27/11.24  % ------ Proving...
% 3.27/11.24  % ------ Problem Properties 
% 3.27/11.24  
% 3.27/11.24  % 
% 3.27/11.24  % clauses                               24
% 3.27/11.24  % conjectures                           6
% 3.27/11.24  % EPR                                   12
% 3.27/11.24  % Horn                                  24
% 3.27/11.24  % unary                                 8
% 3.27/11.24  % binary                                5
% 3.27/11.24  % lits                                  68
% 3.27/11.24  % lits eq                               17
% 3.27/11.24  % fd_pure                               0
% 3.27/11.24  % fd_pseudo                             0
% 3.27/11.24  % fd_cond                               3
% 3.27/11.24  % fd_pseudo_cond                        3
% 3.27/11.24  % AC symbols                            0
% 3.27/11.24  
% 3.27/11.24  % ------ Schedule dynamic 5 is on 
% 3.27/11.24  
% 3.27/11.24  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.27/11.24  
% 3.27/11.24  
% 3.27/11.24  % ------ 
% 3.27/11.24  % Current options:
% 3.27/11.24  % ------ 
% 3.27/11.24  
% 3.27/11.24  
% 3.27/11.24  % 
% 3.27/11.24  
% 3.27/11.24  % ------ Proving...
% 3.27/11.24  % 
% 3.27/11.24  
% 3.27/11.24  % SZS status Unsatisfiable for theBenchmark.p
% 3.27/11.24  
% 3.27/11.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.27/11.24  
% 3.27/11.24  
%------------------------------------------------------------------------------