↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n001.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:06 PM UTC 2026

% Result   : Theorem 1.95s 1.30s
% Output   : CNFRefutation 1.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   38 (  12 unt;   1 def)
%            Number of atoms       :   93 (   1 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   78 (  31   ~;  29   |;  13   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 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  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   49 (   0 sgn  41   !;   8   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).

fof(f12,axiom,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X0,X1)
     => ( apart_point_and_line(X2,X1)
        | distinct_points(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq1) ).

fof(f15,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( ( apart_point_and_line(X0,X3)
          | apart_point_and_line(X0,X2) )
        & convergent_lines(X2,X3)
        & distinct_points(X0,X1) )
     => distinct_points(X0,intersection_point(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( ( apart_point_and_line(X0,X3)
            | apart_point_and_line(X0,X2) )
          & convergent_lines(X2,X3)
          & distinct_points(X0,X1) )
       => distinct_points(X0,intersection_point(X2,X3)) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f29,plain,
    ! [X0,X1,X2] :
      ( ~ apart_point_and_line(X0,X1)
      | apart_point_and_line(X2,X1)
      | distinct_points(X0,X2) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f30,plain,
    ! [X0,X1,X2] :
      ( ~ apart_point_and_line(X0,X1)
      | apart_point_and_line(X2,X1)
      | distinct_points(X0,X2) ),
    inference(flattening,[],[f29]) ).

fof(f35,plain,
    ? [X0,X1,X2,X3] :
      ( ( apart_point_and_line(X0,X3)
        | apart_point_and_line(X0,X2) )
      & convergent_lines(X2,X3)
      & distinct_points(X0,X1)
      & ~ distinct_points(X0,intersection_point(X2,X3)) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f36,plain,
    ? [X0,X1,X2,X3] :
      ( ( apart_point_and_line(X0,X3)
        | apart_point_and_line(X0,X2) )
      & convergent_lines(X2,X3)
      & distinct_points(X0,X1)
      & ~ distinct_points(X0,intersection_point(X2,X3)) ),
    inference(flattening,[],[f35]) ).

fof(f37,plain,
    ( ( apart_point_and_line(sK0,sK3)
      | apart_point_and_line(sK0,sK2) )
    & convergent_lines(sK2,sK3)
    & distinct_points(sK0,sK1)
    & ~ distinct_points(sK0,intersection_point(sK2,sK3)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f36]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f47,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f49,plain,
    ! [X2,X0,X1] :
      ( ~ apart_point_and_line(X0,X1)
      | apart_point_and_line(X2,X1)
      | distinct_points(X0,X2) ),
    inference(cnf_transformation,[],[f30]) ).

fof(f52,plain,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f53,plain,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f37]) ).

fof(f55,plain,
    ~ distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    inference(cnf_transformation,[],[f46]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    inference(cnf_transformation,[],[f47]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( apart_point_and_line(X2,X1)
      | distinct_points(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f49]) ).

tcf(c_63,negated_conjecture,
    ~ distinct_points(sK0,intersection_point(sK2,sK3)),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_65,negated_conjecture,
    convergent_lines(sK2,sK3),
    inference(cnf_transformation,[],[f53]) ).

tcf(c_66,negated_conjecture,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_150,definition,
    iPr_def_10 = intersection_point(sK2,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_151,negated_conjecture,
    ( apart_point_and_line(sK0,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(demodulation,[status(thm)],[c_66]) ).

tcf(c_152,negated_conjecture,
    convergent_lines(sK2,sK3),
    inference(demodulation,[status(thm)],[c_65]) ).

tcf(c_154,negated_conjecture,
    ~ distinct_points(sK0,iPr_def_10),
    inference(demodulation,[status(thm)],[c_63,c_150]) ).

tcf(c_667,plain,
    ( ~ apart_point_and_line(iPr_def_10,sK2)
    | ~ convergent_lines(sK2,sK3) ),
    inference(superposition,[status(thm)],[c_150,c_57]) ).

tcf(c_668,plain,
    ~ apart_point_and_line(iPr_def_10,sK2),
    inference(forward_subsumption_resolution,[status(thm)],[c_667,c_152]) ).

tcf(c_674,plain,
    ( ~ apart_point_and_line(iPr_def_10,sK3)
    | ~ convergent_lines(sK2,sK3) ),
    inference(superposition,[status(thm)],[c_150,c_58]) ).

tcf(c_675,plain,
    ~ apart_point_and_line(iPr_def_10,sK3),
    inference(forward_subsumption_resolution,[status(thm)],[c_674,c_152]) ).

tcf(c_682,plain,
    ! [X0: $i] :
      ( apart_point_and_line(sK0,sK2)
      | apart_point_and_line(X0,sK3)
      | distinct_points(sK0,X0) ),
    inference(superposition,[status(thm)],[c_151,c_60]) ).

tcf(c_762,plain,
    ( apart_point_and_line(iPr_def_10,sK3)
    | apart_point_and_line(sK0,sK2) ),
    inference(superposition,[status(thm)],[c_682,c_154]) ).

tcf(c_763,plain,
    apart_point_and_line(sK0,sK2),
    inference(forward_subsumption_resolution,[status(thm)],[c_762,c_675]) ).

tcf(c_767,plain,
    ! [X0: $i] :
      ( apart_point_and_line(X0,sK2)
      | distinct_points(sK0,X0) ),
    inference(superposition,[status(thm)],[c_763,c_60]) ).

tcf(c_828,plain,
    apart_point_and_line(iPr_def_10,sK2),
    inference(superposition,[status(thm)],[c_767,c_154]) ).

tcf(c_829,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_828,c_668]) ).


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