↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.95s 1.28s
% Output   : CNFRefutation 3.95s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f230ERROR: Could not build tree for root c_2997ERROR: MakeTreeStats fails)

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

fof(f71,axiom,
    ! [X0] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).

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

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

fof(f208,negated_conjecture,
    ( nil = sk4
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

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

fof(f211,plain,
    ( nil = sk4
    | sk3 = cons(sk5,nil) ),
    inference(reorient_equations,[],[f210]) ).

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

fof(f221,plain,
    ~ neq(sk3,nil),
    inference(definition_unfolding,[],[f207,f205]) ).

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

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

tcf(c_254,negated_conjecture,
    neq(sk4,nil),
    inference(cnf_transformation,[],[f220]) ).

tcf(c_255,negated_conjecture,
    ~ neq(sk3,nil),
    inference(cnf_transformation,[],[f221]) ).

tcf(c_256,negated_conjecture,
    ( ssItem(sk5)
    | ( sk4 = nil ) ),
    inference(cnf_transformation,[],[f208]) ).

tcf(c_257,negated_conjecture,
    ( ssItem(sk5)
    | ( sk3 = nil ) ),
    inference(cnf_transformation,[],[f209]) ).

tcf(c_258,negated_conjecture,
    ( ( sk4 = nil )
    | ( cons(sk5,nil) = sk3 ) ),
    inference(cnf_transformation,[],[f211]) ).

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

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

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

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

tcf(c_283,plain,
    ! [X0: $i] :
      ( ~ ssItem(X0)
      | ~ memberP(nil,X0) ),
    inference(cnf_transformation,[],[f71]) ).

tcf(c_1034,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( X1 != sk3 )
      | ( X0 != nil ) ),
    inference(resolution_lifted,[status(thm)],[c_269,c_255]) ).

tcf(c_1035,plain,
    ( ( nil = sk3 )
    | ~ ssList(nil)
    | ~ ssList(sk3) ),
    inference(unflattening,[status(thm)],[c_1034]) ).

tcf(c_1036,plain,
    nil = sk3,
    inference(global_subsumption_just,[status(thm)],[c_1035,c_252,c_265,c_1035]) ).

tcf(c_1055,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( X0 != nil )
      | ( X0 != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_254,c_267]) ).

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

tcf(c_1057,plain,
    sk4 != nil,
    inference(global_subsumption_just,[status(thm)],[c_1056,c_253,c_1056]) ).

tcf(c_1068,plain,
    cons(sk5,nil) = sk3,
    inference(backward_subsumption_resolution,[status(thm)],[c_258,c_1057]) ).

tcf(c_1074,negated_conjecture,
    ssItem(sk5),
    inference(global_subsumption_just,[status(thm)],[c_257,c_253,c_256,c_1056]) ).

tcf(c_1374,plain,
    cons(sk5,nil) = nil,
    inference(light_normalisation,[status(thm)],[c_1068,c_1036]) ).

tcf(c_2994,plain,
    ( memberP(nil,sk5)
    | ~ ssItem(sk5)
    | ~ ssList(nil) ),
    inference(superposition,[status(thm)],[c_1374,c_282]) ).

tcf(c_2995,plain,
    memberP(nil,sk5),
    inference(forward_subsumption_resolution,[status(thm)],[c_2994,c_1074,c_265]) ).

tcf(c_2996,plain,
    ~ ssItem(sk5),
    inference(superposition,[status(thm)],[c_2995,c_283]) ).

tcf(c_2997,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2996,c_1074]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC207-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 : n017.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:54:16 UTC 2026
% 0.04/0.36  % CPUTime  : 
% 0.04/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.04/0.40  Running first-order theorem proving
% 0.04/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.04/0.41  
% 0.04/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.41  
% 0.04/0.41  % Detected problem language: tptp
% 0.04/0.43  % Proving...
% 3.95/1.28  % SZS status Started for theBenchmark.p
% 3.95/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.28  
% 3.95/1.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.95/1.28  
% 3.95/1.28  % ------  iProver source info
% 3.95/1.28  
% 3.95/1.28  % git: date: 2026-07-19 20:42:38 +0200
% 3.95/1.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.95/1.28  % git: non_committed_changes: false
% 3.95/1.28  
% 3.95/1.28  % ------ Parsing...% successful
% 3.95/1.28  
% 3.95/1.28  
% 3.95/1.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.95/1.28  
% 3.95/1.28  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 4  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 % 
% 3.95/1.28  
% 3.95/1.28  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.95/1.28  
% 3.95/1.28  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.95/1.28  % ------ Proving...
% 3.95/1.28  % ------ Problem Properties 
% 3.95/1.28  
% 3.95/1.28  % 
% 3.95/1.28  % clauses                               41
% 3.95/1.28  % conjectures                           3
% 3.95/1.28  % EPR                                   17
% 3.95/1.28  % Horn                                  38
% 3.95/1.28  % unary                                 8
% 3.95/1.28  % binary                                5
% 3.95/1.28  % lits                                  146
% 3.95/1.28  % lits eq                               27
% 3.95/1.28  % fd_pure                               0
% 3.95/1.28  % fd_pseudo                             0
% 3.95/1.28  % fd_cond                               3
% 3.95/1.28  % fd_pseudo_cond                        7
% 3.95/1.28  % AC symbols                            0
% 3.95/1.28  
% 3.95/1.28  % ------ Schedule dynamic 5 is on 
% 3.95/1.28  
% 3.95/1.28  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.28  
% 3.95/1.28  
% 3.95/1.28  % ------ 
% 3.95/1.28  % Current options:
% 3.95/1.28  % ------ 
% 3.95/1.28  
% 3.95/1.28  
% 3.95/1.28  % 
% 3.95/1.28  
% 3.95/1.28  % ------ Proving...
% 3.95/1.28  % 
% 3.95/1.28  
% 3.95/1.28  % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.28  
% 3.95/1.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.28  
% 3.95/1.28  
%------------------------------------------------------------------------------