↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n020.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:44 PM UTC 2026

% Result   : Unsatisfiable 2.80s 1.19s
% Output   : CNFRefutation 2.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  11 unt;   0 def)
%            Number of atoms       :   20 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (  10   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 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-4 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-4 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,axiom,
    ! [X2,X3,X0,X1] : insertion(X0,X1,X2,X3) = extension(extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2),X0,X2,X3),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO002-3.ax',insertion) ).

fof(f47,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( X4 = X5
      | extension(X4,X5,X0,X1) = extension(X4,X5,X2,X3)
      | ~ equidistant(X0,X1,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_2) ).

fof(f69,axiom,
    ! [X0,X1] : X0 != extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e3_1) ).

fof(f70,plain,
    ! [X0,X1] : extension(X1,X0,lower_dimension_point_1,lower_dimension_point_2) != X0,
    inference(reorient_equations,[],[f69]) ).

fof(f84,axiom,
    equidistant(w,x,y,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_to_x_equals_y_to_z) ).

fof(f85,negated_conjecture,
    insertion(u,v,w,x) != insertion(u,v,y,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equality_of_insertions) ).

fof(f97,plain,
    extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x) != extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z),
    inference(definition_unfolding,[],[f85,f20,f20]) ).

tcf(c_163,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( ( X4 = X5 )
      | ( extension(X4,X5,X0,X1) = extension(X4,X5,X2,X3) )
      | ~ equidistant(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f47]) ).

tcf(c_183,plain,
    ! [X0: $i,X1: $i] : extension(X0,X1,lower_dimension_point_1,lower_dimension_point_2) != X1,
    inference(cnf_transformation,[],[f70]) ).

tcf(c_196,plain,
    equidistant(w,x,y,z),
    inference(cnf_transformation,[],[f84]) ).

tcf(c_197,negated_conjecture,
    extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x) != extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z),
    inference(cnf_transformation,[],[f97]) ).

tcf(c_2273,plain,
    ( ( extension(v,u,lower_dimension_point_1,lower_dimension_point_2) = u )
    | ( extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,w,x) = extension(extension(v,u,lower_dimension_point_1,lower_dimension_point_2),u,y,z) )
    | ~ equidistant(w,x,y,z) ),
    inference(instantiation,[status(thm)],[c_163]) ).

tcf(c_2846,plain,
    extension(v,u,lower_dimension_point_1,lower_dimension_point_2) != u,
    inference(instantiation,[status(thm)],[c_183]) ).

tcf(c_2847,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_2846,c_2273,c_197,c_196]) ).


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