↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 3.16s 1.37s
% Output   : CNFRefutation 3.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  14 unt;   0 def)
%            Number of atoms       :   75 (  30 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   74 (  34   ~;  40   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   12 (   0 sgn  12   !;   0   ?;   7   :)

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

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

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

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

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(f207,negated_conjecture,
    ( nil != sk4
    | nil = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

fof(f209,negated_conjecture,
    ( ~ neq(sk4,nil)
    | cons(sk5,nil) = sk3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

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

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

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

tcf(c_249,negated_conjecture,
    ~ totalorderedP(sk3),
    inference(cnf_transformation,[],[f214]) ).

tcf(c_250,negated_conjecture,
    ( ( sk3 = nil )
    | ( sk4 != nil ) ),
    inference(cnf_transformation,[],[f207]) ).

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

tcf(c_252,negated_conjecture,
    ( ( cons(sk5,nil) = sk3 )
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[],[f210]) ).

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

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

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

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

tcf(c_1277,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ( cons(sk5,nil) = sk3 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( X1 != nil )
      | ( X0 != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_252,c_272]) ).

tcf(c_1278,plain,
    ( ( sk4 = nil )
    | ( cons(sk5,nil) = sk3 )
    | ~ ssList(nil)
    | ~ ssList(sk4) ),
    inference(unflattening,[status(thm)],[c_1277]) ).

tcf(c_1279,plain,
    ( ( sk4 = nil )
    | ( cons(sk5,nil) = sk3 ) ),
    inference(global_subsumption_just,[status(thm)],[c_1278,c_248,c_268,c_1278]) ).

tcf(c_1301,plain,
    ! [X0: $i,X1: $i] :
      ( ssItem(sk5)
      | ( X0 = X1 )
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( X1 != nil )
      | ( X0 != sk4 ) ),
    inference(resolution_lifted,[status(thm)],[c_251,c_272]) ).

tcf(c_1302,plain,
    ( ssItem(sk5)
    | ( sk4 = nil )
    | ~ ssList(nil)
    | ~ ssList(sk4) ),
    inference(unflattening,[status(thm)],[c_1301]) ).

tcf(c_1303,plain,
    ( ssItem(sk5)
    | ( sk4 = nil ) ),
    inference(global_subsumption_just,[status(thm)],[c_1302,c_248,c_268,c_1302]) ).

tcf(c_3188,plain,
    ( totalorderedP(sk3)
    | ( sk4 = nil )
    | ~ ssItem(sk5) ),
    inference(superposition,[status(thm)],[c_1279,c_259]) ).

tcf(c_3189,plain,
    ( ( sk4 = nil )
    | ~ ssItem(sk5) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3188,c_249]) ).

tcf(c_3205,plain,
    sk4 = nil,
    inference(global_subsumption_just,[status(thm)],[c_3189,c_1303,c_3189]) ).

tcf(c_3208,plain,
    ( ( sk3 = nil )
    | ( nil != nil ) ),
    inference(demodulation,[status(thm)],[c_250,c_3205]) ).

tcf(c_3210,plain,
    sk3 = nil,
    inference(equality_resolution_simp,[status(thm)],[c_3208]) ).

tcf(c_3211,plain,
    ~ totalorderedP(nil),
    inference(demodulation,[status(thm)],[c_249,c_3210]) ).

tcf(c_3213,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3211,c_260]) ).


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