↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GEO027-3 : 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 : n011.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 01:19:36 PM UTC 2026

% Result   : Unsatisfiable 1.13s 6.20s
% Output   : CNFRefutation 1.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   18 (  11 unt;   0 def)
%            Number of atoms       :   34 (  16 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   31 (  15   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   41 (   0 sgn  41   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X2,X3,X0,X1] : equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).

fof(f31,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( between(X1,X2,X0)
      | X0 != extension(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b0) ).

fof(f32,plain,
    ! [X2,X3,X0,X1,X4] :
      ( between(X1,X2,X0)
      | extension(X1,X2,X3,X4) != X0 ),
    inference(reorient_equations,[],[f31]) ).

fof(f43,axiom,
    ! [X2,X3,X0,X1] :
      ( X2 = X3
      | X0 = X1
      | ~ equidistant(X1,X2,X1,X3)
      | ~ between(X0,X1,X3)
      | ~ between(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9) ).

fof(f44,axiom,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

fof(f45,axiom,
    u != v,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_v) ).

fof(f46,negated_conjecture,
    w != extension(u,v,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_w_is_an_extension) ).

fof(f52,plain,
    ! [X2,X3,X1,X4] : between(X1,X2,extension(X1,X2,X3,X4)),
    inference(equality_resolution,[],[f32]) ).

tcf(c_94,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_118,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : between(X0,X1,extension(X0,X1,X2,X3)),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_126,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X1 = X2 )
      | ( X0 = X3 )
      | ~ between(X3,X0,X2)
      | ~ between(X3,X0,X1)
      | ~ equidistant(X0,X1,X0,X2) ),
    inference(cnf_transformation,[],[f43]) ).

tcf(c_127,plain,
    between(u,v,w),
    inference(cnf_transformation,[],[f44]) ).

tcf(c_128,plain,
    u != v,
    inference(cnf_transformation,[],[f45]) ).

tcf(c_129,negated_conjecture,
    extension(u,v,v,w) != w,
    inference(cnf_transformation,[],[f46]) ).

tcf(c_184,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( X0 = X1 )
      | ( extension(X2,X1,X1,X3) = X3 )
      | ~ between(X0,X1,X3)
      | ~ between(X0,X1,extension(X2,X1,X1,X3)) ),
    inference(superposition,[status(thm)],[c_94,c_126]) ).

tcf(c_243,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( X0 = X1 )
      | ( extension(X0,X1,X1,X2) = X2 )
      | ~ between(X0,X1,X2) ),
    inference(superposition,[status(thm)],[c_118,c_184]) ).

tcf(c_323,plain,
    ( ( u = v )
    | ( extension(u,v,v,w) = w ) ),
    inference(superposition,[status(thm)],[c_127,c_243]) ).

tcf(c_328,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_323,c_129,c_128]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO027-3 : 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/5.37  % Computer : n011.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Wed Sep 23 10:27:48 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.42  Running first-order theorem proving
% 0.16/5.42  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.16/5.43  
% 0.16/5.43  % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.43  
% 0.16/5.43  % Detected problem language: tptp
% 0.16/5.44  % Proving...
% 1.13/6.20  % SZS status Started for theBenchmark.p
% 1.13/6.20  % SZS status Unsatisfiable for theBenchmark.p
% 1.13/6.20  
% 1.13/6.20  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.13/6.20  
% 1.13/6.20  % ------  iProver source info
% 1.13/6.20  
% 1.13/6.20  % git: date: 2026-07-19 20:42:38 +0200
% 1.13/6.20  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.13/6.20  % git: non_committed_changes: false
% 1.13/6.20  
% 1.13/6.20  % ------ Parsing...% successful
% 1.13/6.20  
% 1.13/6.20  
% 1.13/6.20  % ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.13/6.20  % ------ Proving...
% 1.13/6.20  % ------ Problem Properties 
% 1.13/6.20  
% 1.13/6.20  % 
% 1.13/6.20  % clauses                               40
% 1.13/6.20  % conjectures                           1
% 1.13/6.20  % EPR                                   23
% 1.13/6.20  % Horn                                  34
% 1.13/6.20  % unary                                 17
% 1.13/6.20  % binary                                10
% 1.13/6.20  % lits                                  96
% 1.13/6.20  % lits eq                               16
% 1.13/6.20  % fd_pure                               0
% 1.13/6.20  % fd_pseudo                             0
% 1.13/6.20  % fd_cond                               0
% 1.13/6.20  % fd_pseudo_cond                        9
% 1.13/6.20  % AC symbols                            0
% 1.13/6.20  
% 1.13/6.20  % ------ Input Options Time Limit: Unbounded
% 1.13/6.20  
% 1.13/6.20  
% 1.13/6.20  % ------ 
% 1.13/6.20  % Current options:
% 1.13/6.20  % ------ 
% 1.13/6.20  
% 1.13/6.20  
% 1.13/6.20  % 
% 1.13/6.20  
% 1.13/6.20  % ------ Proving...
% 1.13/6.20  % 
% 1.13/6.20  
% 1.13/6.20  % SZS status Unsatisfiable for theBenchmark.p
% 1.13/6.20  
% 1.13/6.20  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/6.20  
% 1.13/6.20  
%------------------------------------------------------------------------------