↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWC041-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 : n011.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 3.61s 1.27s
% Output   : CNFRefutation 3.61s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f301ERROR: Could not build tree for root c_10178ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f84,axiom,
    ! [X0] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ frontsegP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).

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

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

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,
    nil = sk2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

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

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

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

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

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

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

fof(f247,plain,
    ! [X0] :
      ( sk4 = X0
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0) ),
    inference(definition_unfolding,[],[f84,f215,f215]) ).

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

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

tcf(c_330,negated_conjecture,
    ! [X0: $i] :
      ( ( X0 = sk4 )
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0) ),
    inference(cnf_transformation,[],[f247]) ).

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

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

tcf(c_391,negated_conjecture,
    ( ( app(sk4,sk4) = sk4 )
    | ~ ssList(sk4) ),
    inference(cnf_transformation,[],[f301]) ).

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,
    sk3 != sk4,
    inference(cnf_transformation,[],[f270]) ).

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

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

tcf(c_555,negated_conjecture,
    app(sk4,sk4) = sk4,
    inference(global_subsumption_just,[status(thm)],[c_391,c_435,c_391]) ).

tcf(c_795,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_6526,definition,
    iPr_def_12 = app(sk4,sk4),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6527,definition,
    iPr_def_13 = app(sk3,sk5),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_6528,negated_conjecture,
    iPr_def_12 = sk4,
    inference(demodulation,[status(thm)],[c_555,c_6526]) ).

tcf(c_6533,negated_conjecture,
    sk3 != sk4,
    inference(demodulation,[status(thm)],[c_436]) ).

tcf(c_6551,negated_conjecture,
    ! [X0: $i] :
      ( ( X0 = sk4 )
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0) ),
    inference(demodulation,[status(thm)],[c_330]) ).

tcf(c_6578,negated_conjecture,
    iPr_def_13 = sk4,
    inference(demodulation,[status(thm)],[c_438,c_6527]) ).

tcf(c_6579,negated_conjecture,
    ssList(sk5),
    inference(demodulation,[status(thm)],[c_437]) ).

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

tcf(c_9109,plain,
    iPr_def_12 = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_6578,c_6528]) ).

tcf(c_9110,plain,
    sk3 != iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_6533,c_6528]) ).

tcf(c_9118,plain,
    app(sk3,sk5) = iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_6527,c_9109]) ).

tcf(c_9181,plain,
    ( frontsegP(iPr_def_12,sk3)
    | ~ ssList(sk5)
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_9118,c_795]) ).

tcf(c_9183,plain,
    frontsegP(iPr_def_12,sk3),
    inference(forward_subsumption_resolution,[status(thm)],[c_9181,c_6579,c_6581]) ).

tcf(c_9296,plain,
    ! [X0: $i] :
      ( ( X0 = iPr_def_12 )
      | ~ ssList(X0)
      | ~ frontsegP(iPr_def_12,X0) ),
    inference(light_normalisation,[status(thm)],[c_6551,c_6528]) ).

tcf(c_10177,plain,
    ( ( sk3 = iPr_def_12 )
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_9183,c_9296]) ).

tcf(c_10178,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_10177,c_9110,c_6581]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC041-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.10/0.36  % Computer : n011.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:03:44 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.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.61/1.27  % SZS status Started for theBenchmark.p
% 3.61/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.27  
% 3.61/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.61/1.27  
% 3.61/1.27  % ------  iProver source info
% 3.61/1.27  
% 3.61/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 3.61/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.61/1.27  % git: non_committed_changes: false
% 3.61/1.27  
% 3.61/1.27  % ------ Parsing...% successful
% 3.61/1.27  
% 3.61/1.27  
% 3.61/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.61/1.27  
% 3.61/1.27  % ------ 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.61/1.27  
% 3.61/1.27  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.61/1.27  
% 3.61/1.27  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.61/1.27  % ------ Proving...
% 3.61/1.27  % ------ Problem Properties 
% 3.61/1.27  
% 3.61/1.27  % 
% 3.61/1.27  % clauses                               185
% 3.61/1.27  % conjectures                           54
% 3.61/1.27  % EPR                                   58
% 3.61/1.27  % Horn                                  157
% 3.61/1.27  % unary                                 65
% 3.61/1.27  % binary                                21
% 3.61/1.27  % lits                                  553
% 3.61/1.27  % lits eq                               75
% 3.61/1.27  % fd_pure                               0
% 3.61/1.27  % fd_pseudo                             0
% 3.61/1.27  % fd_cond                               15
% 3.61/1.27  % fd_pseudo_cond                        14
% 3.61/1.27  % AC symbols                            0
% 3.61/1.27  
% 3.61/1.27  % ------ Schedule dynamic 5 is on 
% 3.61/1.27  
% 3.61/1.27  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.61/1.27  
% 3.61/1.27  
% 3.61/1.27  % ------ 
% 3.61/1.27  % Current options:
% 3.61/1.27  % ------ 
% 3.61/1.27  
% 3.61/1.27  
% 3.61/1.27  % 
% 3.61/1.27  
% 3.61/1.27  % ------ Proving...
% 3.61/1.27  % 
% 3.61/1.27  
% 3.61/1.27  % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.27  
% 3.61/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.27  
% 3.61/1.27  
%------------------------------------------------------------------------------