↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.25s 6.64s
% Output   : CNFRefutation 3.25s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f265ERROR: Could not build tree for root c_10748ERROR: MakeTreeStats fails)

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

fof(f86,axiom,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).

fof(f100,axiom,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssItem(X0)
      | cons(X0,X1) != X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).

fof(f101,axiom,
    ! [X0,X1] :
      ( X1 = X0
      | neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/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(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

fof(f216,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ neq(sk4,nil)
      | ~ neq(X1,nil)
      | app(X0,X2) != sk1
      | app(app(X0,X1),X2) != sk2
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f217,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f218,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).

fof(f219,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssList(sk7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

fof(f220,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).

fof(f221,plain,
    ( ~ neq(sk4,nil)
    | sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
    inference(reorient_equations,[],[f220]) ).

fof(f222,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(sk6,sk7) = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).

fof(f223,plain,
    ( ~ neq(sk4,nil)
    | sk3 = app(sk6,sk7) ),
    inference(reorient_equations,[],[f222]) ).

fof(f234,plain,
    ! [X2,X0,X1] :
      ( ~ neq(sk4,nil)
      | ~ neq(X1,nil)
      | app(X0,X2) != sk3
      | app(app(X0,X1),X2) != sk4
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f216,f204,f205]) ).

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

tcf(c_339,plain,
    ! [X0: $i,X1: $i] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f86]) ).

tcf(c_352,plain,
    ! [X0: $i,X1: $i] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ( cons(X0,X1) != X1 ) ),
    inference(cnf_transformation,[],[f100]) ).

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

tcf(c_443,negated_conjecture,
    neq(sk4,nil),
    inference(cnf_transformation,[],[f265]) ).

tcf(c_450,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ neq(sk4,nil)
      | ~ neq(X1,nil)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(cnf_transformation,[],[f234]) ).

tcf(c_451,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f217]) ).

tcf(c_452,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f218]) ).

tcf(c_453,negated_conjecture,
    ( ssList(sk7)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f219]) ).

tcf(c_454,negated_conjecture,
    ( ( app(app(sk6,cons(sk5,nil)),sk7) = sk4 )
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f221]) ).

tcf(c_455,negated_conjecture,
    ( ( app(sk6,sk7) = sk3 )
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f223]) ).

tcf(c_569,negated_conjecture,
    ssList(sk7),
    inference(global_subsumption_just,[status(thm)],[c_453,c_443,c_453]) ).

tcf(c_571,negated_conjecture,
    ssList(sk6),
    inference(global_subsumption_just,[status(thm)],[c_452,c_443,c_452]) ).

tcf(c_573,negated_conjecture,
    ssItem(sk5),
    inference(global_subsumption_just,[status(thm)],[c_451,c_443,c_451]) ).

tcf(c_585,negated_conjecture,
    app(sk6,sk7) = sk3,
    inference(global_subsumption_just,[status(thm)],[c_455,c_443,c_455]) ).

tcf(c_593,negated_conjecture,
    app(app(sk6,cons(sk5,nil)),sk7) = sk4,
    inference(global_subsumption_just,[status(thm)],[c_454,c_443,c_454]) ).

tcf(c_597,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(app(X0,X1),X2) != sk4 )
      | ( app(X0,X2) != sk3 )
      | ~ neq(X1,nil) ),
    inference(global_subsumption_just,[status(thm)],[c_450,c_443,c_450]) ).

tcf(c_598,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ neq(X1,nil)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(renaming,[status(thm)],[c_597]) ).

tcf(c_3069,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ( X3 = X4 )
      | ~ ssList(X4)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( X4 != nil )
      | ( X1 != X3 )
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_598,c_353]) ).

tcf(c_3070,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = nil )
      | ~ ssList(nil)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(unflattening,[status(thm)],[c_3069]) ).

tcf(c_3072,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = nil )
      | ( app(app(X0,X1),X2) != sk4 )
      | ( app(X0,X2) != sk3 )
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X2) ),
    inference(global_subsumption_just,[status(thm)],[c_3070,c_261,c_3070]) ).

tcf(c_3073,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = nil )
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(renaming,[status(thm)],[c_3072]) ).

tcf(c_6638,definition,
    iPr_def_12 = cons(sk5,nil),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6639,definition,
    iPr_def_13 = app(sk6,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_6640,definition,
    iPr_def_14 = app(iPr_def_13,sk7),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_6641,definition,
    iPr_def_15 = app(sk6,sk7),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_6642,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = nil )
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk3 )
      | ( app(app(X0,X1),X2) != sk4 ) ),
    inference(demodulation,[status(thm)],[c_3073]) ).

tcf(c_6645,negated_conjecture,
    iPr_def_14 = sk4,
    inference(demodulation,[status(thm)],[c_593,c_6638,c_6639,c_6640]) ).

tcf(c_6646,negated_conjecture,
    iPr_def_15 = sk3,
    inference(demodulation,[status(thm)],[c_585,c_6641]) ).

tcf(c_6647,negated_conjecture,
    ssItem(sk5),
    inference(demodulation,[status(thm)],[c_573]) ).

tcf(c_6648,negated_conjecture,
    ssList(sk6),
    inference(demodulation,[status(thm)],[c_571]) ).

tcf(c_6649,negated_conjecture,
    ssList(sk7),
    inference(demodulation,[status(thm)],[c_569]) ).

tcf(c_9212,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X1 = nil )
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != iPr_def_15 )
      | ( app(app(X0,X1),X2) != iPr_def_14 ) ),
    inference(light_normalisation,[status(thm)],[c_6642,c_6645,c_6646]) ).

tcf(c_9236,plain,
    ! [X0: $i] :
      ( ( nil = iPr_def_12 )
      | ~ ssList(iPr_def_12)
      | ~ ssList(sk6)
      | ~ ssList(X0)
      | ( app(iPr_def_13,X0) != iPr_def_14 )
      | ( app(sk6,X0) != iPr_def_15 ) ),
    inference(superposition,[status(thm)],[c_6639,c_9212]) ).

tcf(c_9237,plain,
    ! [X0: $i] :
      ( ( nil = iPr_def_12 )
      | ~ ssList(iPr_def_12)
      | ~ ssList(X0)
      | ( app(iPr_def_13,X0) != iPr_def_14 )
      | ( app(sk6,X0) != iPr_def_15 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9236,c_6648]) ).

tcf(c_9255,plain,
    ( ( nil = iPr_def_12 )
    | ~ ssList(iPr_def_12)
    | ~ ssList(sk7)
    | ( app(sk6,sk7) != iPr_def_15 ) ),
    inference(superposition,[status(thm)],[c_6640,c_9237]) ).

tcf(c_9256,plain,
    ( ( nil = iPr_def_12 )
    | ~ ssList(iPr_def_12)
    | ~ ssList(sk7) ),
    inference(ground_joinability,[status(thm)],[c_9255,c_6641]) ).

tcf(c_9257,plain,
    ( ( nil = iPr_def_12 )
    | ~ ssList(iPr_def_12) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9256,c_6649]) ).

tcf(c_9744,plain,
    ( ssList(iPr_def_12)
    | ~ ssItem(sk5)
    | ~ ssList(nil) ),
    inference(superposition,[status(thm)],[c_6638,c_339]) ).

tcf(c_9747,plain,
    ssList(iPr_def_12),
    inference(forward_subsumption_resolution,[status(thm)],[c_9744,c_6647,c_261]) ).

tcf(c_9755,plain,
    nil = iPr_def_12,
    inference(backward_subsumption_resolution,[status(thm)],[c_9257,c_9747]) ).

tcf(c_9800,plain,
    cons(sk5,iPr_def_12) = iPr_def_12,
    inference(demodulation,[status(thm)],[c_6638,c_9755]) ).

tcf(c_10746,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(iPr_def_12) ),
    inference(superposition,[status(thm)],[c_9800,c_352]) ).

tcf(c_10748,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_10746,c_6647,c_9747]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC004-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.14/5.81  % Computer : n010.cluster.edu
% 0.14/5.81  % Model    : x86_64 x86_64
% 0.14/5.81  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.81  % Memory   : 8046.5625MB
% 0.14/5.81  % OS       : Linux 6.8.0-71-generic
% 0.14/5.81  % CPULimit : 300
% 0.14/5.81  % WCLimit  : 300
% 0.14/5.81  % DateTime : Thu Sep 24 15:52:56 UTC 2026
% 0.14/5.82  % CPUTime  : 
% 0.14/5.82  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.85  Running first-order theorem proving
% 0.14/5.85  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.14/5.86  
% 0.14/5.86  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.86  
% 0.14/5.86  % Detected problem language: tptp
% 0.14/5.88  % Proving...
% 3.25/6.64  % SZS status Started for theBenchmark.p
% 3.25/6.64  % SZS status Unsatisfiable for theBenchmark.p
% 3.25/6.64  
% 3.25/6.64  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.25/6.64  
% 3.25/6.64  % ------  iProver source info
% 3.25/6.64  
% 3.25/6.64  % git: date: 2026-07-19 20:42:38 +0200
% 3.25/6.64  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.25/6.64  % git: non_committed_changes: false
% 3.25/6.64  
% 3.25/6.64  % ------ Parsing...% successful
% 3.25/6.64  
% 3.25/6.64  
% 3.25/6.64  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.25/6.64  
% 3.25/6.64  % ------ 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.25/6.64  
% 3.25/6.64  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.25/6.64  
% 3.25/6.64  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.25/6.64  % ------ Proving...
% 3.25/6.64  % ------ Problem Properties 
% 3.25/6.64  
% 3.25/6.64  % 
% 3.25/6.64  % clauses                               191
% 3.25/6.64  % conjectures                           7
% 3.25/6.64  % EPR                                   60
% 3.25/6.64  % Horn                                  163
% 3.25/6.64  % unary                                 70
% 3.25/6.64  % binary                                21
% 3.25/6.64  % lits                                  563
% 3.25/6.64  % lits eq                               81
% 3.25/6.64  % fd_pure                               0
% 3.25/6.64  % fd_pseudo                             0
% 3.25/6.64  % fd_cond                               16
% 3.25/6.64  % fd_pseudo_cond                        14
% 3.25/6.64  % AC symbols                            0
% 3.25/6.64  
% 3.25/6.64  % ------ Schedule dynamic 5 is on 
% 3.25/6.64  
% 3.25/6.64  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.25/6.64  
% 3.25/6.64  
% 3.25/6.64  % ------ 
% 3.25/6.64  % Current options:
% 3.25/6.64  % ------ 
% 3.25/6.64  
% 3.25/6.64  
% 3.25/6.64  % 
% 3.25/6.64  
% 3.25/6.64  % ------ Proving...
% 3.25/6.64  % 
% 3.25/6.64  
% 3.25/6.64  % SZS status Unsatisfiable for theBenchmark.p
% 3.25/6.64  
% 3.25/6.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.25/6.64  
% 3.25/6.64  
%------------------------------------------------------------------------------