↑ Up

iProver---3.9.4.UNS-CRf.s

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

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

% Result   : Unsatisfiable 259.65s 36.99s
% Output   : CNFRefutation 259.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   36 (  16 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   56 (  29   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    7 (   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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  115 (   0 sgn 115   !;   0   ?; 106   :)

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

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

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).

fof(f4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).

tcf(c_53,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_54,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
    inference(cnf_transformation,[],[f2]) ).

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

tcf(c_56,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
    inference(cnf_transformation,[],[f4]) ).

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

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

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

tcf(c_78,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(equivalent(equivalent(X0,X0),X1)) ),
    inference(superposition,[status(thm)],[c_74,c_72]) ).

tcf(c_81,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(superposition,[status(thm)],[c_54,c_78]) ).

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

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

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

tcf(c_130,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( is_a_theorem(equivalent(X3,equivalent(equivalent(X0,X4),X2)))
      | ~ is_a_theorem(equivalent(X3,equivalent(X4,X1)))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_74,c_101]) ).

tcf(c_147,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)),equivalent(equivalent(X2,X1),X3))),
    inference(superposition,[status(thm)],[c_54,c_94]) ).

tcf(c_150,plain,
    ! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
    inference(superposition,[status(thm)],[c_81,c_94]) ).

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

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

tcf(c_231,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X1),X0))),
    inference(superposition,[status(thm)],[c_54,c_221]) ).

tcf(c_236,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X0,equivalent(equivalent(X2,X2),X1)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_231,c_101]) ).

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

tcf(c_312,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X1,X0),X2))
      | ~ is_a_theorem(X2)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_237,c_77]) ).

tcf(c_400,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,equivalent(X2,X1)),X3))),X3)),
    inference(superposition,[status(thm)],[c_55,c_183]) ).

tcf(c_443,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( is_a_theorem(equivalent(X0,X4))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,equivalent(X3,X2)),X4))))) ),
    inference(superposition,[status(thm)],[c_400,c_101]) ).

tcf(c_627,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X0),X1),X2)) ),
    inference(superposition,[status(thm)],[c_236,c_221]) ).

tcf(c_3829,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X3,X2),X1),X4)))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),X4)))) ),
    inference(superposition,[status(thm)],[c_55,c_130]) ).

tcf(c_5066,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X0,X2))
      | ~ is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_312,c_221]) ).

tcf(c_6085,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X3),X4))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)),X4)) ),
    inference(superposition,[status(thm)],[c_54,c_5066]) ).

tcf(c_13625,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X4,X3),equivalent(equivalent(X0,X4),X2))))),
    inference(superposition,[status(thm)],[c_54,c_6085]) ).

tcf(c_15061,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X2,X3),X0))))),
    inference(superposition,[status(thm)],[c_13625,c_627]) ).

tcf(c_45304,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(X3,X2),X0)))),
    inference(superposition,[status(thm)],[c_15061,c_3829]) ).

tcf(c_93581,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
    inference(superposition,[status(thm)],[c_45304,c_443]) ).

tcf(c_93606,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_56,c_93581]) ).


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