↑ Up

iProver---3.9.4.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    totalorderedP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause4) ).

fof(f67,axiom,
    ! [X0] :
      ( totalorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause67) ).

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

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

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

fof(f219,negated_conjecture,
    ( nil = sk3
    | cons(sk5,nil) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

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

fof(f221,negated_conjecture,
    ( nil = sk3
    | app(app(sk6,sk3),sk7) = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).

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

fof(f227,plain,
    ~ totalorderedP(sk3),
    inference(definition_unfolding,[],[f206,f205]) ).

tcf(c_259,negated_conjecture,
    ~ totalorderedP(sk3),
    inference(cnf_transformation,[],[f227]) ).

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

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

tcf(c_271,negated_conjecture,
    ( ( sk3 = nil )
    | ( app(app(sk6,sk3),sk7) = sk4 ) ),
    inference(cnf_transformation,[],[f222]) ).

tcf(c_279,plain,
    ! [X0: $i] :
      ( totalorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f67]) ).

tcf(c_280,plain,
    totalorderedP(nil),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_3433,plain,
    ( totalorderedP(sk3)
    | ( sk3 = nil )
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm)],[c_270,c_279]) ).

tcf(c_3434,plain,
    ( ( sk3 = nil )
    | ~ ssItem(sk5) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3433,c_259]) ).

tcf(c_3441,negated_conjecture,
    sk3 = nil,
    inference(global_subsumption_just,[status(thm)],[c_271,c_261,c_3434]) ).

tcf(c_3444,plain,
    ~ totalorderedP(nil),
    inference(demodulation,[status(thm)],[c_259,c_3441]) ).

tcf(c_3446,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3444,c_280]) ).


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