↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWW412-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 : 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 03:29:38 PM UTC 2026

% Result   : Unsatisfiable 4.41s 1.34s
% Output   : CNFRefutation 4.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  19 unt;   0 def)
%            Number of atoms       :   46 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   32 (  16   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    6 (   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    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   44 (   0 sgn  44   !;   0   ?;  32   :)

% 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(f2,axiom,
    ! [X0,X1] : sep(lseg(X0,X0),X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).

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(f10,axiom,
    ! [X2,X0,X1] :
      ( heap(sep(lseg(X0,nil),X2))
      | ~ heap(sep(lseg(X0,X1),sep(lseg(X1,nil),X2))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_3) ).

fof(f17,axiom,
    x3 != x2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_4) ).

fof(f18,plain,
    x2 != x3,
    inference(reorient_equations,[],[f17]) ).

fof(f20,axiom,
    x1 != x4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_6) ).

fof(f22,axiom,
    heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),sep(next(x2,x3),emp))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_8) ).

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

tcf(c_72,plain,
    x2 != x3,
    inference(cnf_transformation,[],[f18]) ).

tcf(c_74,plain,
    x1 != x4,
    inference(cnf_transformation,[],[f20]) ).

tcf(c_76,plain,
    heap(sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x1,x4),sep(next(x2,x3),emp))))),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_77,negated_conjecture,
    ~ heap(sep(lseg(x2,nil),sep(lseg(x1,nil),emp))),
    inference(cnf_transformation,[],[f23]) ).

tcf(c_80,plain,
    ! [X0: $i,X1: $i] : sep(lseg(X0,X0),X1) = X1,
    inference(cnf_transformation,[],[f2]) ).

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

tcf(c_82,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( heap(sep(lseg(X0,nil),X2))
      | ~ heap(sep(lseg(X0,X1),sep(lseg(X1,nil),X2))) ),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_86,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_561,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( heap(sep(lseg(X0,nil),sep(X2,X3)))
      | ~ heap(sep(lseg(X0,X1),sep(X2,sep(lseg(X1,nil),X3)))) ),
    inference(superposition,[status(thm)],[c_81,c_82]) ).

tcf(c_594,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( heap(sep(lseg(X0,X1),X2))
      | ( X0 = X1 )
      | ~ heap(sep(next(X0,X1),X2)) ),
    inference(superposition,[status(thm)],[c_80,c_86]) ).

tcf(c_744,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( heap(sep(lseg(X1,X2),sep(X0,X3)))
      | ( X1 = X2 )
      | ~ heap(sep(X0,sep(next(X1,X2),X3))) ),
    inference(superposition,[status(thm)],[c_81,c_594]) ).

tcf(c_785,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( heap(sep(lseg(X1,nil),sep(X0,X3)))
      | ~ heap(sep(X0,sep(lseg(X1,X2),sep(lseg(X2,nil),X3)))) ),
    inference(superposition,[status(thm)],[c_81,c_561]) ).

tcf(c_1311,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( heap(sep(lseg(X2,X3),sep(X0,sep(X1,X4))))
      | ( X2 = X3 )
      | ~ heap(sep(X0,sep(X1,sep(next(X2,X3),X4)))) ),
    inference(superposition,[status(thm)],[c_81,c_744]) ).

tcf(c_3625,plain,
    ( heap(sep(lseg(x1,x4),sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x2,x3),emp)))))
    | ( x1 = x4 ) ),
    inference(superposition,[status(thm)],[c_76,c_1311]) ).

tcf(c_3634,plain,
    heap(sep(lseg(x1,x4),sep(lseg(x3,nil),sep(lseg(x4,nil),sep(next(x2,x3),emp))))),
    inference(forward_subsumption_resolution,[status(thm)],[c_3625,c_74]) ).

tcf(c_3674,plain,
    heap(sep(lseg(x1,nil),sep(lseg(x3,nil),sep(next(x2,x3),emp)))),
    inference(superposition,[status(thm)],[c_3634,c_561]) ).

tcf(c_3780,plain,
    ( heap(sep(lseg(x2,x3),sep(lseg(x1,nil),sep(lseg(x3,nil),emp))))
    | ( x2 = x3 ) ),
    inference(superposition,[status(thm)],[c_3674,c_1311]) ).

tcf(c_3781,plain,
    heap(sep(lseg(x2,x3),sep(lseg(x1,nil),sep(lseg(x3,nil),emp)))),
    inference(forward_subsumption_resolution,[status(thm)],[c_3780,c_72]) ).

tcf(c_3787,plain,
    heap(sep(lseg(x1,nil),sep(lseg(x2,x3),sep(lseg(x3,nil),emp)))),
    inference(demodulation,[status(thm)],[c_3781,c_81]) ).

tcf(c_3793,plain,
    heap(sep(lseg(x2,nil),sep(lseg(x1,nil),emp))),
    inference(superposition,[status(thm)],[c_3787,c_785]) ).

tcf(c_3794,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_3793,c_77]) ).


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