↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.96s 1.39s
% Output   : CNFRefutation 2.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :   38 (  16 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   32 (  14   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause3) ).

fof(f66,axiom,
    ! [X0] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).

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

fof(f206,negated_conjecture,
    ~ strictorderedP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

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

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

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

fof(f216,negated_conjecture,
    ! [X0] :
      ( nil = sk3
      | ~ leq(X0,sk5)
      | ~ memberP(sk4,X0)
      | sk5 = X0
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f219,plain,
    ~ strictorderedP(sk3),
    inference(definition_unfolding,[],[f206,f205]) ).

tcf(c_253,negated_conjecture,
    ~ strictorderedP(sk3),
    inference(cnf_transformation,[],[f219]) ).

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

tcf(c_259,negated_conjecture,
    ( ( sk3 = nil )
    | ( cons(sk5,nil) = sk3 ) ),
    inference(cnf_transformation,[],[f214]) ).

tcf(c_261,negated_conjecture,
    ! [X0: $i] :
      ( ( sk3 = nil )
      | ( X0 = sk5 )
      | ~ ssItem(X0)
      | ~ leq(X0,sk5)
      | ~ memberP(sk4,X0) ),
    inference(cnf_transformation,[],[f216]) ).

tcf(c_267,plain,
    ! [X0: $i] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f66]) ).

tcf(c_268,plain,
    strictorderedP(nil),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_3249,plain,
    ( strictorderedP(sk3)
    | ( sk3 = nil )
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm)],[c_259,c_267]) ).

tcf(c_3250,plain,
    ( ( sk3 = nil )
    | ~ ssItem(sk5) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3249,c_253]) ).

tcf(c_3260,negated_conjecture,
    sk3 = nil,
    inference(global_subsumption_just,[status(thm)],[c_261,c_255,c_3250]) ).

tcf(c_3263,plain,
    ~ strictorderedP(nil),
    inference(demodulation,[status(thm)],[c_253,c_3260]) ).

tcf(c_3265,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3263,c_268]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC287-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.42  % Computer : n008.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Thu Sep 24 17:26:09 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.48  Running first-order theorem proving
% 0.17/0.48  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.17/0.49  
% 0.17/0.49  % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.49  
% 0.17/0.49  % Detected problem language: tptp
% 0.23/0.51  % Proving...
% 2.96/1.39  % SZS status Started for theBenchmark.p
% 2.96/1.39  % SZS status Unsatisfiable for theBenchmark.p
% 2.96/1.39  
% 2.96/1.39  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.96/1.39  
% 2.96/1.39  % ------  iProver source info
% 2.96/1.39  
% 2.96/1.39  % git: date: 2026-07-19 20:42:38 +0200
% 2.96/1.39  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.96/1.39  % git: non_committed_changes: false
% 2.96/1.39  
% 2.96/1.39  % ------ Parsing...% successful
% 2.96/1.39  
% 2.96/1.39  
% 2.96/1.39  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.96/1.39  
% 2.96/1.39  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 2.96/1.39  
% 2.96/1.39  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.96/1.39  
% 2.96/1.39  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.96/1.39  % ------ Proving...
% 2.96/1.39  % ------ Problem Properties 
% 2.96/1.39  
% 2.96/1.39  % 
% 2.96/1.39  % clauses                               60
% 2.96/1.39  % conjectures                           11
% 2.96/1.39  % EPR                                   22
% 2.96/1.39  % Horn                                  41
% 2.96/1.39  % unary                                 7
% 2.96/1.39  % binary                                13
% 2.96/1.39  % lits                                  225
% 2.96/1.39  % lits eq                               45
% 2.96/1.39  % fd_pure                               0
% 2.96/1.39  % fd_pseudo                             0
% 2.96/1.39  % fd_cond                               12
% 2.96/1.39  % fd_pseudo_cond                        7
% 2.96/1.39  % AC symbols                            0
% 2.96/1.39  
% 2.96/1.39  % ------ Schedule dynamic 5 is on 
% 2.96/1.39  
% 2.96/1.39  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.96/1.39  
% 2.96/1.39  
% 2.96/1.39  % ------ 
% 2.96/1.39  % Current options:
% 2.96/1.39  % ------ 
% 2.96/1.39  
% 2.96/1.39  
% 2.96/1.39  % 
% 2.96/1.39  
% 2.96/1.39  % ------ Proving...
% 2.96/1.39  % 
% 2.96/1.39  
% 2.96/1.39  % SZS status Unsatisfiable for theBenchmark.p
% 2.96/1.39  
% 2.96/1.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.96/1.39  
% 2.96/1.39  
%------------------------------------------------------------------------------