↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SCT042-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n018.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 02:40:39 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f805,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | c_List_Odistinct(c_List_Olist_OCons(X0,c_List_Olist_OCons(X1,c_List_Olist_OCons(v_sko__CHAINED__1(X0,X1),c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).

fof(f806,axiom,
    v_a____ != v_b____,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).

fof(f807,negated_conjecture,
    ~ v_thesis____,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f808,negated_conjecture,
    ! [X0] :
      ( ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X0,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
      | v_thesis____ ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

tcf(c_1318,plain,
    ! [X0: $i,X1: $i] :
      ( c_List_Odistinct(c_List_Olist_OCons(X0,c_List_Olist_OCons(X1,c_List_Olist_OCons(v_sko__CHAINED__1(X0,X1),c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt)
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f805]) ).

tcf(c_1319,plain,
    v_a____ != v_b____,
    inference(cnf_transformation,[],[f806]) ).

tcf(c_1320,negated_conjecture,
    ~ v_thesis____,
    inference(cnf_transformation,[],[f807]) ).

tcf(c_1321,negated_conjecture,
    ! [X0: $i] :
      ( v_thesis____
      | ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X0,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt) ),
    inference(cnf_transformation,[],[f808]) ).

tcf(c_1498,negated_conjecture,
    ! [X0: $i] : ~ c_List_Odistinct(c_List_Olist_OCons(v_a____,c_List_Olist_OCons(v_b____,c_List_Olist_OCons(X0,c_List_Olist_ONil(tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),tc_Arrow__Order__Mirabelle_Oalt),
    inference(global_subsumption_just,[status(thm)],[c_1321,c_1320,c_1321]) ).

tcf(c_1554,plain,
    v_a____ = v_b____,
    inference(superposition,[status(thm)],[c_1318,c_1498]) ).

tcf(c_2290,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1319,c_1554]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SCT042-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37  % Computer : n018.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 08:39:33 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.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.43  % Proving...
% 4.58/1.30  % SZS status Started for theBenchmark.p
% 4.58/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 4.58/1.30  
% 4.58/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.58/1.30  
% 4.58/1.30  % ------  iProver source info
% 4.58/1.30  
% 4.58/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 4.58/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.58/1.30  % git: non_committed_changes: false
% 4.58/1.30  
% 4.58/1.30  % ------ Parsing...% successful
% 4.58/1.30  
% 4.58/1.30  
% 4.58/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 4.58/1.30  % ------ Proving...
% 4.58/1.30  % ------ Problem Properties 
% 4.58/1.30  
% 4.58/1.30  % 
% 4.58/1.30  % clauses                               663
% 4.58/1.30  % conjectures                           2
% 4.58/1.30  % EPR                                   107
% 4.58/1.30  % Horn                                  572
% 4.58/1.30  % unary                                 249
% 4.58/1.30  % binary                                210
% 4.58/1.30  % lits                                  1382
% 4.58/1.30  % lits eq                               551
% 4.58/1.30  % fd_pure                               0
% 4.58/1.30  % fd_pseudo                             0
% 4.58/1.30  % fd_cond                               22
% 4.58/1.30  % fd_pseudo_cond                        99
% 4.58/1.30  % AC symbols                            0
% 4.58/1.30  
% 4.58/1.30  % ------ Input Options Time Limit: Unbounded
% 4.58/1.30  
% 4.58/1.30  
% 4.58/1.30  % ------ 
% 4.58/1.30  % Current options:
% 4.58/1.30  % ------ 
% 4.58/1.30  
% 4.58/1.30  
% 4.58/1.30  % 
% 4.58/1.30  
% 4.58/1.30  % ------ Proving...
% 4.58/1.30  % 
% 4.58/1.30  
% 4.58/1.30  % ------ Proving...
% 4.58/1.30  % 
% 4.58/1.30  
% 4.58/1.30  % SZS status Unsatisfiable for theBenchmark.p
% 4.58/1.30  
% 4.58/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.58/1.30  
% 4.58/1.30  
%------------------------------------------------------------------------------