↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : LCL023-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 : 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:05:26 PM UTC 2026

% Result   : Unsatisfiable 3.77s 1.46s
% Output   : CNFRefutation 3.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (  13 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  19   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    4 (   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   :   57 (   0 sgn  57   !;   0   ?;  52   :)

% 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,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',yql) ).

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

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

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

tcf(c_54,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_124,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_53,c_54]) ).

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

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

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

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

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

tcf(c_277,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(equivalent(X1,X2),X0))
      | ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
    inference(superposition,[status(thm)],[c_235,c_139]) ).

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

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

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

tcf(c_476,plain,
    ! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
    inference(superposition,[status(thm)],[c_235,c_424]) ).

tcf(c_512,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X2)) ),
    inference(superposition,[status(thm)],[c_341,c_424]) ).

tcf(c_705,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(equivalent(X1,X0))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(superposition,[status(thm)],[c_476,c_139]) ).

tcf(c_910,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X1)))),
    inference(superposition,[status(thm)],[c_476,c_512]) ).

tcf(c_1003,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
    inference(superposition,[status(thm)],[c_910,c_705]) ).

tcf(c_1233,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),X1))),
    inference(superposition,[status(thm)],[c_1003,c_424]) ).

tcf(c_1313,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
    inference(superposition,[status(thm)],[c_1233,c_180]) ).

tcf(c_2512,plain,
    ~ is_a_theorem(equivalent(equivalent(b,equivalent(b,c)),c)),
    inference(superposition,[status(thm)],[c_236,c_52]) ).

tcf(c_2518,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_2512,c_1313]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL023-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.46  % Computer : n018.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Wed Sep 23 21:39:48 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.21/0.53  Running first-order theorem proving
% 0.21/0.53  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.21/0.54  
% 0.21/0.54  % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.54  
% 0.21/0.54  % Detected problem language: tptp
% 0.21/0.56  % Proving...
% 3.77/1.46  % SZS status Started for theBenchmark.p
% 3.77/1.46  % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.46  
% 3.77/1.46  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.77/1.46  
% 3.77/1.46  % ------  iProver source info
% 3.77/1.46  
% 3.77/1.46  % git: date: 2026-07-19 20:42:38 +0200
% 3.77/1.46  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.77/1.46  % git: non_committed_changes: false
% 3.77/1.46  
% 3.77/1.46  % ------ Parsing...% successful
% 3.77/1.46  
% 3.77/1.46  
% 3.77/1.46  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.77/1.46  
% 3.77/1.46  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 3.77/1.46  
% 3.77/1.46  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.77/1.46  % ------ Proving...
% 3.77/1.46  % ------ Problem Properties 
% 3.77/1.46  
% 3.77/1.46  % 
% 3.77/1.46  % clauses                               3
% 3.77/1.46  % conjectures                           1
% 3.77/1.46  % EPR                                   0
% 3.77/1.46  % Horn                                  3
% 3.77/1.46  % unary                                 2
% 3.77/1.46  % binary                                0
% 3.77/1.46  % lits                                  5
% 3.77/1.46  % lits eq                               0
% 3.77/1.46  % fd_pure                               0
% 3.77/1.46  % fd_pseudo                             0
% 3.77/1.46  % fd_cond                               0
% 3.77/1.46  % fd_pseudo_cond                        0
% 3.77/1.46  % AC symbols                            0
% 3.77/1.46  
% 3.77/1.46  % ------ Schedule dynamic 5 is on 
% 3.77/1.46  
% 3.77/1.46  % ------ no equalities: superposition off 
% 3.77/1.46  
% 3.77/1.46  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.46  
% 3.77/1.46  
% 3.77/1.46  % ------ 
% 3.77/1.46  % Current options:
% 3.77/1.46  % ------ 
% 3.77/1.46  
% 3.77/1.46  
% 3.77/1.46  % 
% 3.77/1.46  
% 3.77/1.46  % ------ Proving...
% 3.77/1.46  % 
% 3.77/1.46  
% 3.77/1.46  % SZS status Unsatisfiable for theBenchmark.p
% 3.77/1.46  
% 3.77/1.46  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.47  
% 3.77/1.47  
%------------------------------------------------------------------------------