↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.31s 1.26s
% Output   : CNFRefutation 2.31s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f293ERROR: Could not build tree for root c_9172ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f82,axiom,
    ! [X0] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ rearsegP(nil,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).

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,
    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,
    rearsegP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f239,plain,
    ! [X0] :
      ( sk4 = X0
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0) ),
    inference(definition_unfolding,[],[f82,f209,f209]) ).

fof(f264,plain,
    sk3 != sk4,
    inference(definition_unfolding,[],[f208,f209,f206]) ).

tcf(c_324,negated_conjecture,
    ! [X0: $i] :
      ( ( X0 = sk4 )
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0) ),
    inference(cnf_transformation,[],[f239]) ).

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

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

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

tcf(c_432,negated_conjecture,
    rearsegP(sk4,sk3),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_433,negated_conjecture,
    sk3 != sk4,
    inference(cnf_transformation,[],[f264]) ).

tcf(c_547,negated_conjecture,
    app(sk4,sk4) = sk4,
    inference(global_subsumption_just,[status(thm)],[c_387,c_431,c_387]) ).

tcf(c_6411,definition,
    iPr_def_12 = app(sk4,sk4),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6412,negated_conjecture,
    iPr_def_12 = sk4,
    inference(demodulation,[status(thm)],[c_547,c_6411]) ).

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

tcf(c_6435,negated_conjecture,
    ! [X0: $i] :
      ( ( X0 = sk4 )
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0) ),
    inference(demodulation,[status(thm)],[c_324]) ).

tcf(c_6460,negated_conjecture,
    rearsegP(sk4,sk3),
    inference(demodulation,[status(thm)],[c_432]) ).

tcf(c_6462,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_430]) ).

tcf(c_8958,plain,
    rearsegP(iPr_def_12,sk3),
    inference(light_normalisation,[status(thm)],[c_6460,c_6412]) ).

tcf(c_8959,plain,
    sk3 != iPr_def_12,
    inference(light_normalisation,[status(thm)],[c_6416,c_6412]) ).

tcf(c_9159,plain,
    ! [X0: $i] :
      ( ( X0 = iPr_def_12 )
      | ~ ssList(X0)
      | ~ rearsegP(iPr_def_12,X0) ),
    inference(light_normalisation,[status(thm)],[c_6435,c_6412]) ).

tcf(c_9170,plain,
    ( ( sk3 = iPr_def_12 )
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_8958,c_9159]) ).

tcf(c_9172,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_9170,c_8959,c_6462]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC044-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35  % Computer : n019.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Thu Sep 24 16:04:49 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/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.41  % Proving...
% 2.31/1.26  % SZS status Started for theBenchmark.p
% 2.31/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 2.31/1.26  
% 2.31/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.31/1.26  
% 2.31/1.26  % ------  iProver source info
% 2.31/1.26  
% 2.31/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 2.31/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.31/1.26  % git: non_committed_changes: false
% 2.31/1.26  
% 2.31/1.26  % ------ Parsing...% successful
% 2.31/1.26  
% 2.31/1.26  
% 2.31/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.31/1.26  
% 2.31/1.26  % ------ 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 % 
% 2.31/1.26  
% 2.31/1.26  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.31/1.26  
% 2.31/1.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.31/1.26  % ------ Proving...
% 2.31/1.26  % ------ Problem Properties 
% 2.31/1.26  
% 2.31/1.26  % 
% 2.31/1.26  % clauses                               181
% 2.31/1.26  % conjectures                           51
% 2.31/1.26  % EPR                                   56
% 2.31/1.26  % Horn                                  153
% 2.31/1.26  % unary                                 62
% 2.31/1.26  % binary                                21
% 2.31/1.26  % lits                                  545
% 2.31/1.26  % lits eq                               71
% 2.31/1.26  % fd_pure                               0
% 2.31/1.26  % fd_pseudo                             0
% 2.31/1.26  % fd_cond                               15
% 2.31/1.26  % fd_pseudo_cond                        14
% 2.31/1.26  % AC symbols                            0
% 2.31/1.26  
% 2.31/1.26  % ------ Schedule dynamic 5 is on 
% 2.31/1.26  
% 2.31/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.31/1.26  
% 2.31/1.26  
% 2.31/1.26  % ------ 
% 2.31/1.26  % Current options:
% 2.31/1.26  % ------ 
% 2.31/1.26  
% 2.31/1.26  
% 2.31/1.26  % 
% 2.31/1.26  
% 2.31/1.26  % ------ Proving...
% 2.31/1.26  % 
% 2.31/1.26  
% 2.31/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 2.31/1.26  
% 2.31/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.31/1.26  
% 2.31/1.26  
%------------------------------------------------------------------------------