↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n013.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 03:29:38 PM UTC 2026

% Result   : Unsatisfiable 2.80s 1.25s
% Output   : CNFRefutation 2.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   32 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  15   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  19   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

fof(f9,axiom,
    ! [X2,X3,X0,X1] :
      ( heap(sep(lseg(X0,X2),X3))
      | X0 = X1
      | ~ heap(sep(next(X0,X1),sep(lseg(X1,X2),X3))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).

fof(f14,axiom,
    x2 != x1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).

fof(f15,plain,
    x1 != x2,
    inference(reorient_equations,[],[f14]) ).

fof(f16,axiom,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).

fof(f17,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i] : sep(X0,sep(X1,X2)) = sep(X1,sep(X0,X2)),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( heap(sep(lseg(X0,X2),X3))
      | ( X0 = X1 )
      | ~ heap(sep(next(X0,X1),sep(lseg(X1,X2),X3))) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_76,plain,
    x1 != x2,
    inference(cnf_transformation,[],[f15]) ).

tcf(c_77,plain,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_78,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(cnf_transformation,[],[f17]) ).

tcf(c_187,plain,
    ! [X0: $i,X1: $i] :
      ( heap(X0)
      | ~ heap(X1)
      | ( X0 != X1 ) ),
    theory(equality) ).

tcf(c_496,plain,
    ! [X0: $i] :
      ( heap(X0)
      | ~ heap(sep(lseg(x2,nil),sep(next(x1,x2),emp)))
      | ( X0 != sep(lseg(x2,nil),sep(next(x1,x2),emp)) ) ),
    inference(instantiation,[status(thm)],[c_187]) ).

tcf(c_587,plain,
    ! [X0: $i,X1: $i] :
      ( heap(sep(lseg(x1,X0),X1))
      | ( x1 = x2 )
      | ~ heap(sep(next(x1,x2),sep(lseg(x2,X0),X1))) ),
    inference(instantiation,[status(thm)],[c_71]) ).

tcf(c_660,plain,
    ( heap(sep(next(x1,x2),sep(lseg(x2,nil),emp)))
    | ~ heap(sep(lseg(x2,nil),sep(next(x1,x2),emp)))
    | ( sep(next(x1,x2),sep(lseg(x2,nil),emp)) != sep(lseg(x2,nil),sep(next(x1,x2),emp)) ) ),
    inference(instantiation,[status(thm)],[c_496]) ).

tcf(c_661,plain,
    sep(next(x1,x2),sep(lseg(x2,nil),emp)) = sep(lseg(x2,nil),sep(next(x1,x2),emp)),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_1037,plain,
    ( heap(sep(lseg(x1,nil),emp))
    | ( x1 = x2 )
    | ~ heap(sep(next(x1,x2),sep(lseg(x2,nil),emp))) ),
    inference(instantiation,[status(thm)],[c_587]) ).

tcf(c_1038,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_1037,c_661,c_660,c_77,c_78,c_76]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW417-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.33  % Computer : n013.cluster.edu
% 0.09/0.33  % Model    : x86_64 x86_64
% 0.09/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33  % Memory   : 8046.5625MB
% 0.09/0.33  % OS       : Linux 6.8.0-71-generic
% 0.09/0.33  % CPULimit : 300
% 0.09/0.33  % WCLimit  : 300
% 0.09/0.34  % DateTime : Thu Sep 24 22:18:51 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.34  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37  Running first-order theorem proving
% 0.09/0.37  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.38  
% 0.14/0.38  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.38  
% 0.14/0.38  % Detected problem language: tptp
% 0.14/0.39  % Proving...
% 2.80/1.25  % SZS status Started for theBenchmark.p
% 2.80/1.25  % SZS status Unsatisfiable for theBenchmark.p
% 2.80/1.25  
% 2.80/1.25  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.80/1.25  
% 2.80/1.25  % ------  iProver source info
% 2.80/1.25  
% 2.80/1.25  % git: date: 2026-07-19 20:42:38 +0200
% 2.80/1.25  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.80/1.25  % git: non_committed_changes: false
% 2.80/1.25  
% 2.80/1.25  % ------ Parsing...% successful
% 2.80/1.25  
% 2.80/1.25  
% 2.80/1.25  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.80/1.25  
% 2.80/1.25  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 2.80/1.25  
% 2.80/1.25  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.80/1.25  
% 2.80/1.25  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.80/1.25  % ------ Proving...
% 2.80/1.25  % ------ Problem Properties 
% 2.80/1.25  
% 2.80/1.25  % 
% 2.80/1.25  % clauses                               17
% 2.80/1.25  % conjectures                           1
% 2.80/1.25  % EPR                                   3
% 2.80/1.25  % Horn                                  14
% 2.80/1.25  % unary                                 10
% 2.80/1.25  % binary                                4
% 2.80/1.25  % lits                                  27
% 2.80/1.25  % lits eq                               12
% 2.80/1.25  % fd_pure                               0
% 2.80/1.25  % fd_pseudo                             0
% 2.80/1.25  % fd_cond                               1
% 2.80/1.25  % fd_pseudo_cond                        4
% 2.80/1.25  % AC symbols                            0
% 2.80/1.25  
% 2.80/1.25  % ------ Schedule dynamic 5 is on 
% 2.80/1.25  
% 2.80/1.25  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.80/1.25  
% 2.80/1.25  
% 2.80/1.25  % ------ 
% 2.80/1.25  % Current options:
% 2.80/1.25  % ------ 
% 2.80/1.25  
% 2.80/1.25  
% 2.80/1.25  % 
% 2.80/1.25  
% 2.80/1.25  % ------ Proving...
% 2.80/1.25  % 
% 2.80/1.25  
% 2.80/1.25  % SZS status Unsatisfiable for theBenchmark.p
% 2.80/1.25  
% 2.80/1.25  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.80/1.25  
% 2.80/1.25  
%------------------------------------------------------------------------------