↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n012.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:20:30 PM UTC 2026

% Result   : Theorem 0.70s 1.06s
% Output   : CNFRefutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   74 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   71 (  23   ~;  25   |;  18   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 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  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn  57   !;   8   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1,X2] :
      ( divides_points(X2,X0,X1)
    <=> ( ( left_apart_point(X1,X2)
          & left_apart_point(X0,reverse_line(X2)) )
        | ( left_apart_point(X1,reverse_line(X2))
          & left_apart_point(X0,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',div_def) ).

fof(f15,axiom,
    ! [X0,X1] :
      ~ ( left_apart_point(X0,reverse_line(X1))
        | left_apart_point(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag10) ).

fof(f28,axiom,
    ! [X0,X1,X2] :
      ( ( left_apart_point(X0,X2)
        & distinct_points(X0,X1) )
     => ( left_convergent_lines(line_connecting(X0,X1),X2)
        | left_apart_point(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oaguc2) ).

fof(f32,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( divides_points(X3,X0,X2)
        & divides_points(X3,X0,X1) )
     => ~ divides_points(X3,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f33,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( divides_points(X3,X0,X2)
          & divides_points(X3,X0,X1) )
       => ~ divides_points(X3,X1,X2) ),
    inference(negated_conjecture,[status(cth)],[f32]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( divides_points(X2,X0,X1)
     => ( ( left_apart_point(X1,X2)
          & left_apart_point(X0,reverse_line(X2)) )
        | ( left_apart_point(X1,reverse_line(X2))
          & left_apart_point(X0,X2) ) ) ),
    inference(unused_predicate_definition_removal,[],[f3]) ).

fof(f37,plain,
    ! [X0,X1,X2] :
      ( ~ divides_points(X2,X0,X1)
      | ( left_apart_point(X1,X2)
        & left_apart_point(X0,reverse_line(X2)) )
      | ( left_apart_point(X1,reverse_line(X2))
        & left_apart_point(X0,X2) ) ),
    inference(ennf_transformation,[],[f34]) ).

fof(f38,plain,
    ! [X0,X1,X2] :
      ( ~ divides_points(X2,X0,X1)
      | ( left_apart_point(X1,X2)
        & left_apart_point(X0,reverse_line(X2)) )
      | ( left_apart_point(X1,reverse_line(X2))
        & left_apart_point(X0,X2) ) ),
    inference(flattening,[],[f37]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ left_apart_point(X0,reverse_line(X1))
      & ~ left_apart_point(X0,X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1)
      | left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1)
      | left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2) ),
    inference(flattening,[],[f65]) ).

fof(f73,plain,
    ? [X0,X1,X2,X3] :
      ( divides_points(X3,X0,X2)
      & divides_points(X3,X0,X1)
      & divides_points(X3,X1,X2) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f74,plain,
    ? [X0,X1,X2,X3] :
      ( divides_points(X3,X0,X2)
      & divides_points(X3,X0,X1)
      & divides_points(X3,X1,X2) ),
    inference(flattening,[],[f73]) ).

fof(f75,plain,
    ( divides_points(sK3,sK0,sK2)
    & divides_points(sK3,sK0,sK1)
    & divides_points(sK3,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f74]) ).

fof(f81,plain,
    ! [X2,X0,X1] :
      ( ~ divides_points(X2,X0,X1)
      | left_apart_point(X0,reverse_line(X2))
      | left_apart_point(X0,X2) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f95,plain,
    ! [X0,X1] : ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f51]) ).

fof(f111,plain,
    ! [X2,X0,X1] :
      ( ~ left_apart_point(X0,X2)
      | ~ distinct_points(X0,X1)
      | left_convergent_lines(line_connecting(X0,X1),X2)
      | left_apart_point(X1,X2) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f117,plain,
    divides_points(sK3,sK1,sK2),
    inference(cnf_transformation,[],[f75]) ).

tcf(c_51,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( left_apart_point(X1,X0)
      | left_apart_point(X1,reverse_line(X0))
      | ~ divides_points(X0,X1,X2) ),
    inference(cnf_transformation,[],[f81]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i] : ~ left_apart_point(X0,X1),
    inference(cnf_transformation,[],[f95]) ).

tcf(c_84,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( left_apart_point(X2,X1)
      | left_convergent_lines(line_connecting(X0,X2),X1)
      | ~ distinct_points(X0,X2)
      | ~ left_apart_point(X0,X1) ),
    inference(cnf_transformation,[],[f111]) ).

tcf(c_88,negated_conjecture,
    divides_points(sK3,sK1,sK2),
    inference(cnf_transformation,[],[f117]) ).

tcf(c_124,plain,
    ! [X0: $i,X1: $i] : ~ left_apart_point(X0,X1),
    inference(global_subsumption_just,[status(thm)],[c_84,c_67]) ).

tcf(c_153,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( left_apart_point(X1,X0)
      | ~ divides_points(X0,X1,X2) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_51,c_124]) ).

tcf(c_171,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ divides_points(X0,X1,X2),
    inference(forward_subsumption_resolution,[status(thm)],[c_153,c_124]) ).

tcf(c_176,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_88,c_171]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : GEO238+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.02  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30  % Computer : n012.cluster.edu
% 0.04/0.30  % Model    : x86_64 x86_64
% 0.04/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30  % Memory   : 8046.5625MB
% 0.04/0.30  % OS       : Linux 6.8.0-71-generic
% 0.04/0.30  % CPULimit : 300
% 0.04/0.30  % WCLimit  : 300
% 0.04/0.30  % DateTime : Wed Sep 23 11:37:06 UTC 2026
% 0.04/0.30  % CPUTime  : 
% 0.04/0.30  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32  Running first-order theorem proving
% 0.04/0.32  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.07/0.33  
% 0.07/0.33  % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33  
% 0.07/0.33  % Detected problem language: tptp
% 0.07/0.34  % Proving...
% 0.70/1.06  % SZS status Started for theBenchmark.p
% 0.70/1.06  % SZS status Theorem for theBenchmark.p
% 0.70/1.06  
% 0.70/1.06  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.70/1.06  
% 0.70/1.06  % ------  iProver source info
% 0.70/1.06  
% 0.70/1.06  % git: date: 2026-07-19 20:42:38 +0200
% 0.70/1.06  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.70/1.06  % git: non_committed_changes: false
% 0.70/1.06  
% 0.70/1.06  % ------ Parsing...
% 0.70/1.06  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 0.70/1.06  
% 0.70/1.06  % ------ Preprocessing...% 
% 0.70/1.06  
% 0.70/1.06  % SZS status Theorem for theBenchmark.p
% 0.70/1.06  
% 0.70/1.06  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.70/1.06  
% 0.70/1.06  
%------------------------------------------------------------------------------