↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n004.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:45:31 PM UTC 2026

% Result   : Theorem 1.61s 1.44s
% Output   : CNFRefutation 1.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   3 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   41 (  20   ~;  14   |;   3   &)
%                                         (   3 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   48 (   0 sgn  24   !;  24   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ? [X0,X1] : a(X0,X1)
  <=> ? [X1,X0] : a(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0,X1] : a(X0,X1)
    <=> ? [X1,X0] : a(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ( ? [X0,X1] : a(X0,X1)
    <=> ? [X2,X3] : a(X3,X2) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ? [X0,X1] : a(X0,X1)
  <~> ? [X2,X3] : a(X3,X2) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ? [X0,X1] : a(X0,X1)
      | ? [X2,X3] : a(X3,X2) )
    & ( ! [X0,X1] : ~ a(X0,X1)
      | ! [X2,X3] : ~ a(X3,X2) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f6,plain,
    ( ( ? [X6,X7] : a(X6,X7)
      | ? [X4,X5] : a(X5,X4) )
    & ( ! [X2,X3] : ~ a(X2,X3)
      | ! [X0,X1] : ~ a(X1,X0) ) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ( a(sK2,sK3)
      | a(sK1,sK0) )
    & ( ! [X2,X3] : ~ a(X2,X3)
      | ! [X0,X1] : ~ a(X1,X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X4,sK0),skolemize(X5,sK1),skolemize(X6,sK2),skolemize(X7,sK3)],[f6]) ).

fof(f8,plain,
    ( a(sK2,sK3)
    | a(sK1,sK0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X2,X3,X0,X1] :
      ( ~ a(X2,X3)
      | ~ a(X1,X0) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ~ a(X2,X3)
      | ~ a(X0,X1) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_50,negated_conjecture,
    ( a(sK2,sK3)
    | a(sK1,sK0) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_60,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ iPr_def_10
      | ~ a(X0,X1) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_49]) ).

tcf(c_61,negated_conjecture,
    iPr_def_10,
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_49]) ).

tcf(c_63,negated_conjecture,
    iPr_def_10,
    inference(demodulation,[status(thm)],[c_61]) ).

tcf(c_65,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ iPr_def_10
      | ~ a(X0,X1) ),
    inference(demodulation,[status(thm)],[c_60]) ).

tcf(c_66,plain,
    ( ~ iPr_def_10
    | ~ a(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_67,plain,
    ( ~ iPr_def_10
    | ~ a(sK2,sK3) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_68,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_67,c_66,c_63,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN960+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.37  % Computer : n004.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 02:40:06 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.44  Running first-order theorem proving
% 0.09/0.44  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.09/0.46  
% 0.09/0.46  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.46  
% 0.09/0.46  % Detected problem language: tptp
% 0.20/0.49  % Proving...
% 1.61/1.44  % SZS status Started for theBenchmark.p
% 1.61/1.44  % SZS status Theorem for theBenchmark.p
% 1.61/1.44  
% 1.61/1.44  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.61/1.44  
% 1.61/1.44  % ------  iProver source info
% 1.61/1.44  
% 1.61/1.44  % git: date: 2026-07-19 20:42:38 +0200
% 1.61/1.44  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.61/1.44  % git: non_committed_changes: false
% 1.61/1.44  
% 1.61/1.44  % ------ Parsing...
% 1.61/1.44  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 1.61/1.44  % 
% 1.61/1.44  
% 1.61/1.44  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.61/1.44  
% 1.61/1.44  % ------ Preprocessing...% ------  preprocesses with Option_epr_non_horn_non_eq
% 1.61/1.44   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.61/1.44  % ------ Proving...
% 1.61/1.44  % ------ Problem Properties 
% 1.61/1.44  
% 1.61/1.44  % 
% 1.61/1.44  % clauses                               3
% 1.61/1.44  % conjectures                           3
% 1.61/1.44  % EPR                                   3
% 1.61/1.44  % Horn                                  2
% 1.61/1.44  % unary                                 1
% 1.61/1.44  % binary                                2
% 1.61/1.44  % lits                                  5
% 1.61/1.44  % lits eq                               0
% 1.61/1.44  % fd_pure                               0
% 1.61/1.44  % fd_pseudo                             0
% 1.61/1.44  % fd_cond                               0
% 1.61/1.44  % fd_pseudo_cond                        0
% 1.61/1.44  % AC symbols                            0
% 1.61/1.44  
% 1.61/1.44  % ------ Schedule EPR non Horn non eq is on
% 1.61/1.44  
% 1.61/1.44  % ------ no equalities: superposition off 
% 1.61/1.44  
% 1.61/1.44  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.61/1.44  
% 1.61/1.44  
% 1.61/1.44  % ------ 
% 1.61/1.44  % Current options:
% 1.61/1.44  % ------ 
% 1.61/1.44  
% 1.61/1.44  
% 1.61/1.44  % 
% 1.61/1.44  
% 1.61/1.44  % ------ Proving...
% 1.61/1.44  % 
% 1.61/1.44  
% 1.61/1.44  % SZS status Theorem for theBenchmark.p
% 1.61/1.44  
% 1.61/1.44  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.61/1.44  
% 1.61/1.44  
%------------------------------------------------------------------------------