↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n005.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:05:25 PM UTC 2026

% Result   : Unsatisfiable 23.58s 4.28s
% Output   : CNFRefutation 23.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   50 (  21 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   74 (  38   ~;  36   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  141 (   0 sgn 141   !;   0   ?; 136   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yqf) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yql) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X2,X1)))),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_54,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c)))),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,X1))
      | ~ is_a_theorem(equivalent(X0,X2))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_62,c_52]) ).

tcf(c_73,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X2,equivalent(equivalent(X0,X3),equivalent(X3,X1))))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_53,c_64]) ).

tcf(c_102,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(equivalent(X0,X3),equivalent(X3,X1)))
      | ~ is_a_theorem(X2)
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_73,c_52]) ).

tcf(c_182,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(equivalent(X0,X3),equivalent(X3,X2)))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X2))) ),
    inference(superposition,[status(thm)],[c_53,c_102]) ).

tcf(c_234,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,equivalent(X2,equivalent(X0,X2))))),
    inference(superposition,[status(thm)],[c_53,c_182]) ).

tcf(c_239,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X0,X2))))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_234,c_52]) ).

tcf(c_240,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X3,X0)))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,X1)))) ),
    inference(superposition,[status(thm)],[c_234,c_102]) ).

tcf(c_272,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,equivalent(X0,X2)))
      | ~ is_a_theorem(X1)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_239,c_52]) ).

tcf(c_275,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X3,equivalent(equivalent(X0,X2),X3)))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X2))) ),
    inference(superposition,[status(thm)],[c_53,c_272]) ).

tcf(c_287,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X2))),X0))),
    inference(superposition,[status(thm)],[c_53,c_275]) ).

tcf(c_320,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X2))),X0))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_287,c_52]) ).

tcf(c_321,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X2,X3))))),X0))),
    inference(superposition,[status(thm)],[c_287,c_275]) ).

tcf(c_357,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X2,X3))),X1)))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_320,c_272]) ).

tcf(c_461,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,equivalent(X2,equivalent(X2,X0))))),
    inference(superposition,[status(thm)],[c_53,c_240]) ).

tcf(c_521,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X0))))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_461,c_52]) ).

tcf(c_526,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,equivalent(X2,X0)))
      | ~ is_a_theorem(X1)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_521,c_52]) ).

tcf(c_577,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X3,equivalent(X3,equivalent(X2,X0))))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X2)))) ),
    inference(superposition,[status(thm)],[c_461,c_526]) ).

tcf(c_616,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X2))),X0))),
    inference(superposition,[status(thm)],[c_461,c_357]) ).

tcf(c_775,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X2))),X0))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_616,c_52]) ).

tcf(c_784,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X2,X3))))))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_775,c_526]) ).

tcf(c_799,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X1,X2)))))),
    inference(superposition,[status(thm)],[c_321,c_784]) ).

tcf(c_819,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X1,X2)))))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_799,c_52]) ).

tcf(c_840,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2))))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_819,c_52]) ).

tcf(c_903,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

tcf(c_904,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
    inference(superposition,[status(thm)],[c_53,c_840]) ).

tcf(c_920,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,X1))
      | ~ is_a_theorem(equivalent(X0,X2))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_903,c_52]) ).

tcf(c_1450,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(X1,X1)))),
    inference(superposition,[status(thm)],[c_904,c_577]) ).

tcf(c_1538,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(equivalent(X0,equivalent(X1,X1)))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_1450,c_52]) ).

tcf(c_1547,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(equivalent(X1,X1))
      | ~ is_a_theorem(X0) ),
    inference(superposition,[status(thm)],[c_1538,c_52]) ).

tcf(c_1603,plain,
    ! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
    inference(superposition,[status(thm)],[c_1450,c_1547]) ).

tcf(c_1619,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(equivalent(X1,X0))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_1603,c_920]) ).

tcf(c_1649,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X1,X2)),equivalent(X0,X2))),
    inference(superposition,[status(thm)],[c_53,c_1619]) ).

tcf(c_1656,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(X1,X2))),equivalent(X2,X0))),
    inference(superposition,[status(thm)],[c_461,c_1619]) ).

tcf(c_9656,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_53,c_52]) ).

tcf(c_9664,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X2)))) ),
    inference(superposition,[status(thm)],[c_1656,c_52]) ).

tcf(c_9983,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(superposition,[status(thm)],[c_9656,c_9664]) ).

tcf(c_10002,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X2,equivalent(X1,X0))))),
    inference(superposition,[status(thm)],[c_1649,c_9664]) ).

tcf(c_10096,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X2,X0)))),
    inference(superposition,[status(thm)],[c_53,c_9983]) ).

tcf(c_10236,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X2),equivalent(X0,X2)))),
    inference(superposition,[status(thm)],[c_10096,c_9983]) ).

tcf(c_10980,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))),
    inference(superposition,[status(thm)],[c_10002,c_9983]) ).

tcf(c_15438,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X2,equivalent(X1,X0)))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(superposition,[status(thm)],[c_10980,c_52]) ).

tcf(c_18964,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
    inference(superposition,[status(thm)],[c_10236,c_15438]) ).

tcf(c_23804,plain,
    $false,
    inference(superposition,[status(thm)],[c_18964,c_54]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.37  % Computer : n005.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Wed Sep 23 21:36:32 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/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.12/0.42  
% 0.12/0.42  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42  
% 0.12/0.42  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 23.58/4.28  % SZS status Started for theBenchmark.p
% 23.58/4.28  % SZS status Unsatisfiable for theBenchmark.p
% 23.58/4.28  
% 23.58/4.28  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 23.58/4.28  
% 23.58/4.28  % ------  iProver source info
% 23.58/4.28  
% 23.58/4.28  % git: date: 2026-07-19 20:42:38 +0200
% 23.58/4.28  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 23.58/4.28  % git: non_committed_changes: false
% 23.58/4.28  
% 23.58/4.28  % ------ Parsing...% successful
% 23.58/4.28  
% 23.58/4.28  
% 23.58/4.28  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 23.58/4.28  
% 23.58/4.28  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e % 
% 23.58/4.28  
% 23.58/4.28  % ------ Preprocessing...
% 23.58/4.28  % ------ Proving...
% 23.58/4.28  % ------ Problem Properties 
% 23.58/4.28  
% 23.58/4.28  % 
% 23.58/4.28  % clauses                               3
% 23.58/4.28  % conjectures                           1
% 23.58/4.28  % EPR                                   0
% 23.58/4.28  % Horn                                  3
% 23.58/4.28  % unary                                 2
% 23.58/4.28  % binary                                0
% 23.58/4.28  % lits                                  5
% 23.58/4.28  % lits eq                               0
% 23.58/4.28  % fd_pure                               0
% 23.58/4.28  % fd_pseudo                             0
% 23.58/4.28  % fd_cond                               0
% 23.58/4.28  % fd_pseudo_cond                        0
% 23.58/4.28  % AC symbols                            0
% 23.58/4.28  
% 23.58/4.28  % ------ Input Options Time Limit: Unbounded
% 23.58/4.28  
% 23.58/4.28  
% 23.58/4.28  % ------ 
% 23.58/4.28  % Current options:
% 23.58/4.28  % ------ 
% 23.58/4.28  
% 23.58/4.28  
% 23.58/4.28  % 
% 23.58/4.28  
% 23.58/4.28  % ------ Proving...
% 23.58/4.28  % 
% 23.58/4.28  
% 23.58/4.28  % SZS status Unsatisfiable for theBenchmark.p
% 23.58/4.28  
% 23.58/4.28  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 23.58/4.28  
% 23.58/4.28  
%------------------------------------------------------------------------------