↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 1.20s 1.18s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f254ERROR: Could not build tree for root c_3939ERROR: MakeTreeStats fails)

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

fof(f73,axiom,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).

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

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

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(f212,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f213,negated_conjecture,
    ( ~ neq(sk4,nil)
    | app(cons(sk5,nil),sk3) = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f214,plain,
    ( ~ neq(sk4,nil)
    | sk4 = app(cons(sk5,nil),sk3) ),
    inference(reorient_equations,[],[f213]) ).

fof(f215,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f223,plain,
    ( ~ neq(sk4,nil)
    | ~ segmentP(sk4,sk3) ),
    inference(definition_unfolding,[],[f215,f204,f205]) ).

fof(f238,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

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

tcf(c_320,plain,
    ! [X0: $i] :
      ( ( app(X0,nil) = X0 )
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f73]) ).

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

tcf(c_420,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(app(X0,X1),X2)) ),
    inference(cnf_transformation,[],[f238]) ).

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

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

tcf(c_437,negated_conjecture,
    neq(sk4,nil),
    inference(cnf_transformation,[],[f254]) ).

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

tcf(c_442,negated_conjecture,
    ( ( app(cons(sk5,nil),sk3) = sk4 )
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f214]) ).

tcf(c_443,negated_conjecture,
    ( ~ segmentP(sk4,sk3)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f223]) ).

tcf(c_532,plain,
    app(sk4,nil) = sk4,
    inference(superposition,[status(thm)],[c_436,c_320]) ).

tcf(c_563,negated_conjecture,
    app(cons(sk5,nil),sk3) = sk4,
    inference(global_subsumption_just,[status(thm)],[c_442,c_437,c_442]) ).

tcf(c_740,plain,
    ! [X0: $i] :
      ( segmentP(app(sk4,X0),sk3)
      | ~ ssList(sk3)
      | ~ ssList(X0)
      | ~ ssList(cons(sk5,nil))
      | ~ ssList(app(app(cons(sk5,nil),sk3),X0)) ),
    inference(superposition,[status(thm)],[c_563,c_420]) ).

tcf(c_1536,plain,
    ! [X0: $i] :
      ( segmentP(app(sk4,X0),sk3)
      | ~ ssList(app(app(cons(sk5,nil),sk3),X0))
      | ~ ssList(cons(sk5,nil))
      | ~ ssList(X0) ),
    inference(global_subsumption_just,[status(thm)],[c_740,c_435,c_740]) ).

tcf(c_1537,plain,
    ! [X0: $i] :
      ( segmentP(app(sk4,X0),sk3)
      | ~ ssList(X0)
      | ~ ssList(cons(sk5,nil))
      | ~ ssList(app(app(cons(sk5,nil),sk3),X0)) ),
    inference(renaming,[status(thm)],[c_1536]) ).

tcf(c_1543,plain,
    ! [X0: $i] :
      ( segmentP(app(sk4,X0),sk3)
      | ~ ssList(X0)
      | ~ ssList(cons(sk5,nil))
      | ~ ssList(app(sk4,X0)) ),
    inference(light_normalisation,[status(thm)],[c_1537,c_563]) ).

tcf(c_1552,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(nil)
    | ~ ssList(app(sk4,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(superposition,[status(thm)],[c_532,c_1543]) ).

tcf(c_3930,plain,
    ( ~ ssList(app(sk4,nil))
    | ~ ssList(cons(sk5,nil)) ),
    inference(global_subsumption_just,[status(thm)],[c_1552,c_255,c_437,c_443,c_1552]) ).

tcf(c_3934,plain,
    ( ~ ssList(sk4)
    | ~ ssList(cons(sk5,nil)) ),
    inference(light_normalisation,[status(thm)],[c_3930,c_532]) ).

tcf(c_3937,plain,
    ~ ssList(cons(sk5,nil)),
    inference(forward_subsumption_resolution,[status(thm)],[c_3934,c_436]) ).

tcf(c_3938,plain,
    ( ~ ssItem(sk5)
    | ~ ssList(nil) ),
    inference(superposition,[status(thm)],[c_333,c_3937]) ).

tcf(c_3939,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3938,c_441,c_437,c_255]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC364-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.09/0.36  % Computer : n001.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 17:57:08 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/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.11/0.41  
% 0.11/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41  
% 0.11/0.41  % Detected problem language: tptp
% 0.11/0.42  % Proving...
% 1.20/1.18  % SZS status Started for theBenchmark.p
% 1.20/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.18  
% 1.20/1.18  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.20/1.18  
% 1.20/1.18  % ------  iProver source info
% 1.20/1.18  
% 1.20/1.18  % git: date: 2026-07-19 20:42:38 +0200
% 1.20/1.18  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.20/1.18  % git: non_committed_changes: false
% 1.20/1.18  
% 1.20/1.18  % ------ Parsing...% successful
% 1.20/1.18  
% 1.20/1.18  
% 1.20/1.18  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.20/1.18  % ------ Proving...
% 1.20/1.18  % ------ Problem Properties 
% 1.20/1.18  
% 1.20/1.18  % 
% 1.20/1.18  % clauses                               196
% 1.20/1.18  % conjectures                           11
% 1.20/1.18  % EPR                                   65
% 1.20/1.18  % Horn                                  161
% 1.20/1.18  % unary                                 59
% 1.20/1.18  % binary                                32
% 1.20/1.18  % lits                                  591
% 1.20/1.18  % lits eq                               76
% 1.20/1.18  % fd_pure                               0
% 1.20/1.18  % fd_pseudo                             0
% 1.20/1.18  % fd_cond                               17
% 1.20/1.18  % fd_pseudo_cond                        17
% 1.20/1.18  % AC symbols                            0
% 1.20/1.18  
% 1.20/1.18  % ------ Input Options Time Limit: Unbounded
% 1.20/1.18  
% 1.20/1.18  
% 1.20/1.18  % ------ 
% 1.20/1.18  % Current options:
% 1.20/1.18  % ------ 
% 1.20/1.18  
% 1.20/1.18  
% 1.20/1.18  % 
% 1.20/1.18  
% 1.20/1.18  % ------ Proving...
% 1.20/1.18  % 
% 1.20/1.18  
% 1.20/1.18  % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.18  
% 1.20/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/1.18  
% 1.20/1.18  
%------------------------------------------------------------------------------