↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Result   : Unsatisfiable 10.22s 2.26s
% Output   : CNFRefutation 10.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  16 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  19   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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;   2 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  56   !;   0   ?;  45   :)

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

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

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).

fof(f5,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).

fof(f6,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(a,b)),not(b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_39) ).

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

tcf(c_56,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(cnf_transformation,[],[f2]) ).

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

tcf(c_58,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_59,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_60,negated_conjecture,
    ~ is_a_theorem(implies(not(implies(a,b)),not(b))),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_217,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[c_55,c_56]) ).

tcf(c_293,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(implies(not(X0),not(X1))) ),
    inference(resolution,[status(thm)],[c_59,c_55]) ).

tcf(c_355,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[c_57,c_55]) ).

tcf(c_375,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(X1,X0),X0))
      | ~ is_a_theorem(implies(implies(X0,X1),X1)) ),
    inference(resolution,[status(thm)],[c_58,c_55]) ).

tcf(c_441,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[c_355,c_55]) ).

tcf(c_462,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[c_375,c_217]) ).

tcf(c_506,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(X0,implies(X2,X1)))
      | ~ is_a_theorem(implies(X0,implies(not(X1),not(X2)))) ),
    inference(resolution,[status(thm)],[c_441,c_59]) ).

tcf(c_509,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(X1)
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[status(thm)],[c_441,c_462]) ).

tcf(c_910,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[c_506,c_56]) ).

tcf(c_1306,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(resolution,[status(thm)],[c_910,c_506]) ).

tcf(c_1526,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(not(not(X1)),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[c_1306,c_509]) ).

tcf(c_1637,plain,
    ! [X0: $i] : is_a_theorem(implies(not(not(X0)),X0)),
    inference(resolution,[status(thm)],[c_1526,c_56]) ).

tcf(c_1833,plain,
    ! [X0: $i] : is_a_theorem(implies(X0,not(not(X0)))),
    inference(resolution,[status(thm)],[c_1637,c_293]) ).

tcf(c_2127,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(X0,not(not(X1))))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[c_1833,c_441]) ).

tcf(c_10327,plain,
    ! [X0: $i,X1: $i] :
      ( is_a_theorem(implies(not(X1),X0))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(resolution,[status(thm)],[c_2127,c_293]) ).

tcf(c_16473,plain,
    ! [X0: $i,X1: $i] : is_a_theorem(implies(not(implies(X0,X1)),not(X1))),
    inference(resolution,[status(thm)],[c_10327,c_1306]) ).

tcf(c_18581,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_60,c_16473]) ).


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