↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.50s 1.17s
% Output   : CNFRefutation 3.50s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f244ERROR: Could not build tree for root c_9281ERROR: MakeTreeStats fails)

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

fof(f61,axiom,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).

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

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

fof(f102,plain,
    ! [X0,X1] :
      ( X0 = X1
      | neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(reorient_equations,[],[f101]) ).

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

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

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

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,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ! [X0] :
      ( ~ frontsegP(sk1,X0)
      | ~ frontsegP(sk2,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

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

fof(f214,negated_conjecture,
    ( nil != sk3
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f217,plain,
    neq(sk4,nil),
    inference(definition_unfolding,[],[f206,f204]) ).

fof(f218,plain,
    ! [X0] :
      ( ~ frontsegP(sk3,X0)
      | ~ frontsegP(sk4,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f207,f204,f205]) ).

fof(f230,plain,
    ! [X0,X1] :
      ( frontsegP(app(X0,X1),X0)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f155]) ).

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

tcf(c_307,plain,
    ! [X0: $i] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f61]) ).

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

tcf(c_346,plain,
    ! [X0: $i,X1: $i] :
      ( neq(X1,X0)
      | ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f102]) ).

tcf(c_361,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ neq(X0,X0) ),
    inference(cnf_transformation,[],[f244]) ).

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

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

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

tcf(c_436,negated_conjecture,
    neq(sk4,nil),
    inference(cnf_transformation,[],[f217]) ).

tcf(c_437,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0)
      | ~ neq(X0,nil) ),
    inference(cnf_transformation,[],[f218]) ).

tcf(c_438,negated_conjecture,
    ssList(sk5),
    inference(cnf_transformation,[],[f208]) ).

tcf(c_439,negated_conjecture,
    app(sk3,sk5) = sk4,
    inference(cnf_transformation,[],[f210]) ).

tcf(c_442,negated_conjecture,
    ( ( sk4 = nil )
    | ( sk3 != nil ) ),
    inference(cnf_transformation,[],[f214]) ).

tcf(c_803,plain,
    ! [X0: $i,X1: $i] :
      ( frontsegP(app(X0,X1),X0)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_390,c_331]) ).

tcf(c_2884,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = X2 )
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0)
      | ( X2 != nil )
      | ( X0 != X1 ) ),
    inference(resolution_lifted,[status(thm)],[c_437,c_346]) ).

tcf(c_2885,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(unflattening,[status(thm)],[c_2884]) ).

tcf(c_2887,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ frontsegP(sk3,X0)
      | ~ frontsegP(sk4,X0)
      | ~ ssList(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_2885,c_254,c_2885]) ).

tcf(c_2888,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(renaming,[status(thm)],[c_2887]) ).

tcf(c_2927,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( X0 != nil )
      | ( X0 != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_361,c_436]) ).

tcf(c_2928,plain,
    ( ~ ssList(sk4)
    | ( sk4 != nil ) ),
    inference(unflattening,[status(thm)],[c_2927]) ).

tcf(c_2929,plain,
    sk4 != nil,
    inference(global_subsumption_just,[status(thm)],[c_2928,c_435,c_2928]) ).

tcf(c_2941,plain,
    sk3 != nil,
    inference(backward_subsumption_resolution,[status(thm)],[c_442,c_2929]) ).

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

tcf(c_6657,plain,
    sk3 != nil,
    inference(demodulation,[status(thm)],[c_2941]) ).

tcf(c_6660,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(demodulation,[status(thm)],[c_2888]) ).

tcf(c_6663,negated_conjecture,
    iPr_def_12 = sk4,
    inference(demodulation,[status(thm)],[c_439,c_6656]) ).

tcf(c_6664,negated_conjecture,
    ssList(sk5),
    inference(demodulation,[status(thm)],[c_438]) ).

tcf(c_6666,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_434]) ).

tcf(c_9221,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ frontsegP(iPr_def_12,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(light_normalisation,[status(thm)],[c_6660,c_6663]) ).

tcf(c_9244,plain,
    ( frontsegP(iPr_def_12,sk3)
    | ~ ssList(sk5)
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_6656,c_803]) ).

tcf(c_9246,plain,
    frontsegP(iPr_def_12,sk3),
    inference(forward_subsumption_resolution,[status(thm)],[c_9244,c_6664,c_6666]) ).

tcf(c_9280,plain,
    ( ( sk3 = nil )
    | ~ ssList(sk3)
    | ~ frontsegP(iPr_def_12,sk3) ),
    inference(superposition,[status(thm)],[c_307,c_9221]) ).

tcf(c_9281,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_9280,c_6657,c_6666,c_9246]) ).


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