↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.43s 1.09s
% Output   : CNFRefutation 2.43s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f245ERROR: Could not build tree for root c_12770ERROR: MakeTreeStats fails)

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

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,
    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(f207,negated_conjecture,
    ! [X0] :
      ( ~ rearsegP(sk1,X0)
      | ~ rearsegP(sk2,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0)
      | nil = sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

fof(f209,negated_conjecture,
    ! [X0] :
      ( ~ rearsegP(sk1,X0)
      | ~ rearsegP(sk2,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0)
      | nil != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( neq(sk3,nil)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( rearsegP(sk4,sk3)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

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

fof(f213,negated_conjecture,
    ( rearsegP(sk4,sk3)
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

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

fof(f218,plain,
    ( neq(sk4,nil)
    | nil != sk3 ),
    inference(definition_unfolding,[],[f208,f205,f204]) ).

fof(f219,plain,
    ! [X0] :
      ( ~ rearsegP(sk3,X0)
      | ~ rearsegP(sk4,X0)
      | ~ neq(X0,nil)
      | ~ ssList(X0)
      | nil != sk3 ),
    inference(definition_unfolding,[],[f209,f205,f204,f205]) ).

tcf(c_306,plain,
    ! [X0: $i] :
      ( rearsegP(X0,X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f59]) ).

tcf(c_329,plain,
    ! [X0: $i] :
      ( ( X0 = nil )
      | ~ ssList(X0)
      | ~ rearsegP(nil,X0) ),
    inference(cnf_transformation,[],[f82]) ).

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

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

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

tcf(c_438,negated_conjecture,
    ! [X0: $i] :
      ( ( sk4 = nil )
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0)
      | ~ rearsegP(sk3,X0)
      | ~ neq(X0,nil) ),
    inference(cnf_transformation,[],[f217]) ).

tcf(c_439,negated_conjecture,
    ( neq(sk4,nil)
    | ( sk3 != nil ) ),
    inference(cnf_transformation,[],[f218]) ).

tcf(c_440,negated_conjecture,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ~ rearsegP(sk4,X0)
      | ~ rearsegP(sk3,X0)
      | ~ neq(X0,nil)
      | ( sk3 != nil ) ),
    inference(cnf_transformation,[],[f219]) ).

tcf(c_441,negated_conjecture,
    ( neq(sk3,nil)
    | ( sk4 = nil ) ),
    inference(cnf_transformation,[],[f210]) ).

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

tcf(c_443,negated_conjecture,
    ( neq(sk3,nil)
    | ( sk3 = nil ) ),
    inference(cnf_transformation,[],[f212]) ).

tcf(c_444,negated_conjecture,
    ( rearsegP(sk4,sk3)
    | ( sk3 = nil ) ),
    inference(cnf_transformation,[],[f213]) ).

tcf(c_3614,plain,
    ! [X0: $i] :
      ( ( sk4 = nil )
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0)
      | ~ rearsegP(sk3,X0)
      | ( nil != nil )
      | ( sk3 != nil )
      | ( X0 != sk3 ) ),
    inference(resolution_lifted,[status(thm)],[c_440,c_441]) ).

tcf(c_3615,plain,
    ( ( sk4 = nil )
    | ~ ssList(sk3)
    | ~ rearsegP(sk4,sk3)
    | ~ rearsegP(sk3,sk3)
    | ( sk3 != nil ) ),
    inference(unflattening,[status(thm)],[c_3614]) ).

tcf(c_3616,plain,
    ( ( sk4 = nil )
    | ~ rearsegP(sk3,sk3)
    | ( sk3 != nil ) ),
    inference(global_subsumption_just,[status(thm)],[c_3615,c_435,c_442,c_3615]) ).

tcf(c_3627,plain,
    ! [X0: $i] :
      ( ( sk4 = nil )
      | ( sk3 = nil )
      | ~ ssList(X0)
      | ~ rearsegP(sk4,X0)
      | ~ rearsegP(sk3,X0)
      | ( nil != nil )
      | ( X0 != sk3 ) ),
    inference(resolution_lifted,[status(thm)],[c_438,c_443]) ).

tcf(c_3628,plain,
    ( ( sk4 = nil )
    | ( sk3 = nil )
    | ~ ssList(sk3)
    | ~ rearsegP(sk4,sk3)
    | ~ rearsegP(sk3,sk3) ),
    inference(unflattening,[status(thm)],[c_3627]) ).

tcf(c_3629,plain,
    ( ( sk4 = nil )
    | ~ rearsegP(sk3,sk3) ),
    inference(global_subsumption_just,[status(thm)],[c_3628,c_435,c_442,c_3616,c_3628]) ).

tcf(c_3774,plain,
    ! [X0: $i] :
      ( ( sk4 = nil )
      | ~ ssList(X0)
      | ( X0 != nil )
      | ( X0 != sk3 ) ),
    inference(resolution_lifted,[status(thm)],[c_441,c_362]) ).

tcf(c_3775,plain,
    ( ( sk4 = nil )
    | ~ ssList(sk3)
    | ( sk3 != nil ) ),
    inference(unflattening,[status(thm)],[c_3774]) ).

tcf(c_3804,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( sk3 != nil )
      | ( X0 != nil )
      | ( X0 != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_362,c_439]) ).

tcf(c_3805,plain,
    ( ~ ssList(sk4)
    | ( sk4 != nil )
    | ( sk3 != nil ) ),
    inference(unflattening,[status(thm)],[c_3804]) ).

tcf(c_3806,plain,
    sk3 != nil,
    inference(global_subsumption_just,[status(thm)],[c_3805,c_436,c_435,c_3775,c_3805]) ).

tcf(c_3825,negated_conjecture,
    rearsegP(sk4,sk3),
    inference(global_subsumption_just,[status(thm)],[c_442,c_444,c_3806]) ).

tcf(c_9690,negated_conjecture,
    rearsegP(sk4,sk3),
    inference(demodulation,[status(thm)],[c_3825]) ).

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

tcf(c_9694,plain,
    ( ( sk4 = nil )
    | ~ rearsegP(sk3,sk3) ),
    inference(demodulation,[status(thm)],[c_3629]) ).

tcf(c_9696,negated_conjecture,
    ssList(sk3),
    inference(demodulation,[status(thm)],[c_435]) ).

tcf(c_12274,plain,
    ( ( sk4 = nil )
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_306,c_9694]) ).

tcf(c_12276,plain,
    sk4 = nil,
    inference(forward_subsumption_resolution,[status(thm)],[c_12274,c_9696]) ).

tcf(c_12277,plain,
    rearsegP(nil,sk3),
    inference(demodulation,[status(thm)],[c_9690,c_12276]) ).

tcf(c_12769,plain,
    ( ( sk3 = nil )
    | ~ ssList(sk3) ),
    inference(superposition,[status(thm)],[c_12277,c_329]) ).

tcf(c_12770,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_12769,c_9691,c_9696]) ).


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