↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n015.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:13:03 PM UTC 2026

% Result   : Theorem 0.43s 1.29s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :   80 (  10 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   70 (  24   ~;  18   |;  24   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   48 (   0 sgn  39   !;   9   ?;  11   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : ~ less(X0,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( ( leq(X1,X0)
        & leq(X0,X1) )
     => X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
     => leq(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).

fof(f11,axiom,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
    <=> ( leq(X0,X2)
        & less(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).

fof(f39,conjecture,
    ~ ? [X0,X1,X2] :
        ( leq(v200,X2)
        & in_lopen(X2,v0,v200)
        & less(v400,X1)
        & in_lopen(X1,v0,v400)
        & leq(v600,X0)
        & in_lopen(X0,v0,v600) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl432) ).

fof(f40,negated_conjecture,
    ~ ~ ? [X0,X1,X2] :
          ( leq(v200,X2)
          & in_lopen(X2,v0,v200)
          & less(v400,X1)
          & in_lopen(X1,v0,v400)
          & leq(v600,X0)
          & in_lopen(X0,v0,v600) ),
    inference(negated_conjecture,[status(cth)],[f39]) ).

fof(f41,plain,
    ? [X0,X1,X2] :
      ( leq(v200,X2)
      & in_lopen(X2,v0,v200)
      & less(v400,X1)
      & in_lopen(X1,v0,v400)
      & leq(v600,X0)
      & in_lopen(X0,v0,v600) ),
    inference(flattening,[],[f40]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( in_lopen(X0,X1,X2)
     => ( leq(X0,X2)
        & less(X1,X0) ) ),
    inference(unused_predicate_definition_removal,[],[f11]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | ~ leq(X0,X1)
      | X0 = X1 ),
    inference(ennf_transformation,[],[f5]) ).

fof(f50,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | ~ leq(X0,X1)
      | X0 = X1 ),
    inference(flattening,[],[f49]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | leq(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f58,plain,
    ! [X0,X1,X2] :
      ( ~ in_lopen(X0,X1,X2)
      | ( leq(X0,X2)
        & less(X1,X0) ) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f71,plain,
    ( leq(v200,sK2)
    & in_lopen(sK2,v0,v200)
    & less(v400,sK1)
    & in_lopen(sK1,v0,v400)
    & leq(v600,sK0)
    & in_lopen(sK0,v0,v600) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f41]) ).

fof(f72,plain,
    ! [X0] : ~ less(X0,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ leq(X1,X0)
      | ~ leq(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f83,plain,
    ! [X2,X0,X1] :
      ( ~ in_lopen(X0,X1,X2)
      | leq(X0,X2) ),
    inference(cnf_transformation,[],[f58]) ).

fof(f112,plain,
    less(v400,sK1),
    inference(cnf_transformation,[],[f71]) ).

fof(f113,plain,
    in_lopen(sK1,v0,v400),
    inference(cnf_transformation,[],[f71]) ).

tcf(c_49,plain,
    ! [X0: $i] : ~ less(X0,X0),
    inference(cnf_transformation,[],[f72]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ leq(X1,X0)
      | ~ leq(X0,X1) ),
    inference(cnf_transformation,[],[f78]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i] :
      ( leq(X0,X1)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f79]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( leq(X0,X2)
      | ~ in_lopen(X0,X1,X2) ),
    inference(cnf_transformation,[],[f83]) ).

tcf(c_89,negated_conjecture,
    in_lopen(sK1,v0,v400),
    inference(cnf_transformation,[],[f113]) ).

tcf(c_90,negated_conjecture,
    less(v400,sK1),
    inference(cnf_transformation,[],[f112]) ).

tcf(c_368,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( leq(X0,X2)
      | ( X2 != v400 )
      | ( X1 != v0 )
      | ( X0 != sK1 ) ),
    inference(resolution_lifted,[status(thm)],[c_61,c_89]) ).

tcf(c_369,plain,
    leq(sK1,v400),
    inference(unflattening,[status(thm)],[c_368]) ).

tcf(c_397,plain,
    leq(sK1,v400),
    inference(demodulation,[status(thm)],[c_369]) ).

tcf(c_401,negated_conjecture,
    less(v400,sK1),
    inference(demodulation,[status(thm)],[c_90]) ).

tcf(c_783,plain,
    leq(v400,sK1),
    inference(superposition,[status(thm)],[c_401,c_56]) ).

tcf(c_1312,plain,
    ( ( v400 = sK1 )
    | ~ leq(sK1,v400) ),
    inference(superposition,[status(thm)],[c_783,c_55]) ).

tcf(c_1322,plain,
    v400 = sK1,
    inference(forward_subsumption_resolution,[status(thm)],[c_1312,c_397]) ).

tcf(c_1338,plain,
    less(v400,v400),
    inference(demodulation,[status(thm)],[c_401,c_1322]) ).

tcf(c_1339,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1338,c_49]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT084+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38  % Computer : n015.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Thu Sep 24 01:24:41 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/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.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...
% 0.43/1.29  % SZS status Started for theBenchmark.p
% 0.43/1.29  % SZS status Theorem for theBenchmark.p
% 0.43/1.29  
% 0.43/1.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/1.29  
% 0.43/1.29  % ------  iProver source info
% 0.43/1.29  
% 0.43/1.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.43/1.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/1.29  % git: non_committed_changes: false
% 0.43/1.29  
% 0.43/1.29  % ------ Parsing...
% 0.43/1.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.43/1.29  
% 0.43/1.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe_e % 
% 0.43/1.29  
% 0.43/1.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 0.43/1.29  
% 0.43/1.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 0.43/1.29  % ------ Proving...
% 0.43/1.29  % ------ Problem Properties 
% 0.43/1.29  
% 0.43/1.29  % 
% 0.43/1.29  % clauses                               44
% 0.43/1.29  % conjectures                           3
% 0.43/1.29  % EPR                                   38
% 0.43/1.29  % Horn                                  38
% 0.43/1.29  % unary                                 30
% 0.43/1.29  % binary                                3
% 0.43/1.29  % lits                                  72
% 0.43/1.29  % lits eq                               25
% 0.43/1.29  % fd_pure                               0
% 0.43/1.29  % fd_pseudo                             0
% 0.43/1.29  % fd_cond                               3
% 0.43/1.29  % fd_pseudo_cond                        3
% 0.43/1.29  % AC symbols                            0
% 0.43/1.29  
% 0.43/1.29  % ------ Schedule dynamic 5 is on 
% 0.43/1.29  
% 0.43/1.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.29  
% 0.43/1.29  
% 0.43/1.29  % ------ 
% 0.43/1.29  % Current options:
% 0.43/1.29  % ------ 
% 0.43/1.29  
% 0.43/1.29  
% 0.43/1.29  % 
% 0.43/1.29  
% 0.43/1.29  % ------ Proving...
% 0.43/1.29  % 
% 0.43/1.29  
% 0.43/1.29  % SZS status Theorem for theBenchmark.p
% 0.43/1.29  
% 0.43/1.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.43/1.29  
% 0.43/1.29  
%------------------------------------------------------------------------------