↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 2.66s 1.29s
% Output   : CNFRefutation 2.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   32 (  24 unt;   3 def)
%            Number of atoms       :   75 (  28 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   63 (  36   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn  17   !;   0   ?;  11   :)

% Comments : 
%------------------------------------------------------------------------------
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,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk2
      | app(app(X0,X1),X2) != sk1
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ssList(sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    app(app(sk5,sk6),sk7) = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f211,plain,
    sk3 = app(app(sk5,sk6),sk7),
    inference(reorient_equations,[],[f210]) ).

fof(f212,negated_conjecture,
    app(sk5,sk7) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f213,plain,
    sk4 = app(sk5,sk7),
    inference(reorient_equations,[],[f212]) ).

fof(f216,plain,
    ! [X2,X0,X1] :
      ( app(X0,X2) != sk4
      | app(app(X0,X1),X2) != sk3
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f206,f205,f204]) ).

tcf(c_435,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk4 )
      | ( app(app(X0,X1),X2) != sk3 ) ),
    inference(cnf_transformation,[],[f216]) ).

tcf(c_436,negated_conjecture,
    ssList(sk5),
    inference(cnf_transformation,[],[f207]) ).

tcf(c_437,negated_conjecture,
    ssList(sk6),
    inference(cnf_transformation,[],[f208]) ).

tcf(c_438,negated_conjecture,
    ssList(sk7),
    inference(cnf_transformation,[],[f209]) ).

tcf(c_439,negated_conjecture,
    app(app(sk5,sk6),sk7) = sk3,
    inference(cnf_transformation,[],[f211]) ).

tcf(c_440,negated_conjecture,
    app(sk5,sk7) = sk4,
    inference(cnf_transformation,[],[f213]) ).

tcf(c_6477,definition,
    iPr_def_12 = app(sk5,sk7),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_6478,definition,
    iPr_def_13 = app(sk5,sk6),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_6479,definition,
    iPr_def_14 = app(iPr_def_13,sk7),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_6480,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != sk4 )
      | ( app(app(X0,X1),X2) != sk3 ) ),
    inference(demodulation,[status(thm)],[c_435]) ).

tcf(c_6481,negated_conjecture,
    iPr_def_12 = sk4,
    inference(demodulation,[status(thm)],[c_440,c_6477]) ).

tcf(c_6482,negated_conjecture,
    iPr_def_14 = sk3,
    inference(demodulation,[status(thm)],[c_439,c_6478,c_6479]) ).

tcf(c_6483,negated_conjecture,
    ssList(sk7),
    inference(demodulation,[status(thm)],[c_438]) ).

tcf(c_6484,negated_conjecture,
    ssList(sk6),
    inference(demodulation,[status(thm)],[c_437]) ).

tcf(c_6485,negated_conjecture,
    ssList(sk5),
    inference(demodulation,[status(thm)],[c_436]) ).

tcf(c_9014,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ( app(X0,X2) != iPr_def_12 )
      | ( app(app(X0,X1),X2) != iPr_def_14 ) ),
    inference(light_normalisation,[status(thm)],[c_6480,c_6481,c_6482]) ).

tcf(c_9059,plain,
    ! [X0: $i] :
      ( ~ ssList(sk6)
      | ~ ssList(sk5)
      | ~ ssList(X0)
      | ( app(iPr_def_13,X0) != iPr_def_14 )
      | ( app(sk5,X0) != iPr_def_12 ) ),
    inference(superposition,[status(thm)],[c_6478,c_9014]) ).

tcf(c_9060,plain,
    ! [X0: $i] :
      ( ~ ssList(X0)
      | ( app(iPr_def_13,X0) != iPr_def_14 )
      | ( app(sk5,X0) != iPr_def_12 ) ),
    inference(forward_subsumption_resolution,[status(thm)],[c_9059,c_6484,c_6485]) ).

tcf(c_9072,plain,
    ( ~ ssList(sk7)
    | ( app(iPr_def_13,sk7) != iPr_def_14 ) ),
    inference(superposition,[status(thm)],[c_6477,c_9060]) ).

tcf(c_9073,plain,
    ~ ssList(sk7),
    inference(ground_joinability,[status(thm)],[c_9072,c_6479]) ).

tcf(c_9074,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_9073,c_6483]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC095-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.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Thu Sep 24 16:21:49 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.41  Running first-order theorem proving
% 0.11/0.41  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.42  
% 0.11/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42  
% 0.11/0.42  % Detected problem language: tptp
% 0.11/0.44  % Proving...
% 2.66/1.29  % SZS status Started for theBenchmark.p
% 2.66/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.29  
% 2.66/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.66/1.29  
% 2.66/1.29  % ------  iProver source info
% 2.66/1.29  
% 2.66/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 2.66/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.66/1.29  % git: non_committed_changes: false
% 2.66/1.29  
% 2.66/1.29  % ------ Parsing...% successful
% 2.66/1.29  
% 2.66/1.29  
% 2.66/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.66/1.29  
% 2.66/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 2.66/1.29  
% 2.66/1.29  % ------ Preprocessing... gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.66/1.29  
% 2.66/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.66/1.29  % ------ Proving...
% 2.66/1.29  % ------ Problem Properties 
% 2.66/1.29  
% 2.66/1.29  % 
% 2.66/1.29  % clauses                               188
% 2.66/1.29  % conjectures                           8
% 2.66/1.29  % EPR                                   59
% 2.66/1.29  % Horn                                  160
% 2.66/1.29  % unary                                 68
% 2.66/1.29  % binary                                21
% 2.66/1.29  % lits                                  556
% 2.66/1.29  % lits eq                               76
% 2.66/1.29  % fd_pure                               0
% 2.66/1.29  % fd_pseudo                             0
% 2.66/1.29  % fd_cond                               15
% 2.66/1.29  % fd_pseudo_cond                        14
% 2.66/1.29  % AC symbols                            0
% 2.66/1.29  
% 2.66/1.29  % ------ Schedule dynamic 5 is on 
% 2.66/1.29  
% 2.66/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.66/1.29  
% 2.66/1.29  
% 2.66/1.29  % ------ 
% 2.66/1.29  % Current options:
% 2.66/1.29  % ------ 
% 2.66/1.29  
% 2.66/1.29  
% 2.66/1.29  % 
% 2.66/1.29  
% 2.66/1.29  % ------ Proving...
% 2.66/1.29  % 
% 2.66/1.29  
% 2.66/1.29  % SZS status Unsatisfiable for theBenchmark.p
% 2.66/1.29  
% 2.66/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.66/1.29  
% 2.66/1.29  
%------------------------------------------------------------------------------