↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : GEO171+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 : n013.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:04 PM UTC 2026

% Result   : Theorem 1.65s 6.49s
% Output   : CNFRefutation 1.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  10 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   57 (  23   ~;  28   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   43 (   0 sgn  41   !;   2   ?;  11   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] : ~ convergent_lines(X0,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).

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

fof(f14,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( convergent_lines(X0,X2)
        | distinct_lines(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).

fof(f15,conjecture,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => distinct_lines(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X1] :
        ( convergent_lines(X0,X1)
       => distinct_lines(X0,X1) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X1,X2)
      | convergent_lines(X0,X2) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f22,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X1,X2)
      | convergent_lines(X0,X2) ),
    inference(flattening,[],[f21]) ).

fof(f33,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X0,X2)
      | distinct_lines(X1,X2) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X0,X2)
      | distinct_lines(X1,X2) ),
    inference(flattening,[],[f33]) ).

fof(f35,plain,
    ? [X0,X1] :
      ( convergent_lines(X0,X1)
      & ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f36,plain,
    ( convergent_lines(sK0,sK1)
    & ~ distinct_lines(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f35]) ).

fof(f39,plain,
    ! [X0] : ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f42,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X1,X2)
      | convergent_lines(X0,X2) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X0,X2)
      | distinct_lines(X1,X2) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f51,plain,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f36]) ).

fof(f52,plain,
    ~ distinct_lines(sK0,sK1),
    inference(cnf_transformation,[],[f36]) ).

tcf(c_51,plain,
    ! [X0: $i] : ~ convergent_lines(X0,X0),
    inference(cnf_transformation,[],[f39]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( convergent_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f42]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( convergent_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f50]) ).

tcf(c_63,negated_conjecture,
    ~ distinct_lines(sK0,sK1),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_64,negated_conjecture,
    convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f51]) ).

tcf(c_65,plain,
    ~ convergent_lines(sK0,sK0),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_170,plain,
    ! [X0: $i] :
      ( convergent_lines(sK1,X0)
      | convergent_lines(sK0,X0)
      | ~ convergent_lines(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_54]) ).

tcf(c_171,plain,
    ( convergent_lines(sK1,sK0)
    | convergent_lines(sK0,sK0)
    | ~ convergent_lines(sK0,sK1) ),
    inference(instantiation,[status(thm)],[c_170]) ).

tcf(c_175,plain,
    ! [X0: $i,X1: $i] :
      ( convergent_lines(sK1,X1)
      | distinct_lines(X0,X1)
      | ~ convergent_lines(sK1,X0) ),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_179,plain,
    ! [X0: $i] :
      ( convergent_lines(sK1,sK1)
      | distinct_lines(X0,sK1)
      | ~ convergent_lines(sK1,X0) ),
    inference(instantiation,[status(thm)],[c_175]) ).

tcf(c_180,plain,
    ~ convergent_lines(sK1,sK1),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_181,plain,
    ( convergent_lines(sK1,sK1)
    | distinct_lines(sK0,sK1)
    | ~ convergent_lines(sK1,sK0) ),
    inference(instantiation,[status(thm)],[c_179]) ).

tcf(c_182,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_180,c_181,c_171,c_65,c_63,c_64]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO171+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/5.59  % Computer : n013.cluster.edu
% 0.10/5.59  % Model    : x86_64 x86_64
% 0.10/5.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.59  % Memory   : 8046.5625MB
% 0.10/5.59  % OS       : Linux 6.8.0-71-generic
% 0.10/5.59  % CPULimit : 300
% 0.10/5.59  % WCLimit  : 300
% 0.10/5.59  % DateTime : Wed Sep 23 11:14:36 UTC 2026
% 0.10/5.59  % CPUTime  : 
% 0.10/5.59  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.63  Running first-order theorem proving
% 0.14/5.63  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.14/5.64  
% 0.14/5.64  % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.64  
% 0.14/5.64  % Detected problem language: tptp
% 0.14/5.65  % Proving...
% 1.65/6.49  % SZS status Started for theBenchmark.p
% 1.65/6.49  % SZS status Theorem for theBenchmark.p
% 1.65/6.49  
% 1.65/6.49  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.65/6.49  
% 1.65/6.49  % ------  iProver source info
% 1.65/6.49  
% 1.65/6.49  % git: date: 2026-07-19 20:42:38 +0200
% 1.65/6.49  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.65/6.49  % git: non_committed_changes: false
% 1.65/6.49  
% 1.65/6.49  % ------ Parsing...
% 1.65/6.49  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.65/6.49  
% 1.65/6.49  % ------ Preprocessing... sf_s  rm: 9 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.65/6.49  
% 1.65/6.49  % ------ Preprocessing...% ------  preprocesses with Option_epr_non_horn_non_eq
% 1.65/6.49   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.65/6.49  % ------ Proving...
% 1.65/6.49  % ------ Problem Properties 
% 1.65/6.49  
% 1.65/6.49  % 
% 1.65/6.49  % clauses                               7
% 1.65/6.49  % conjectures                           2
% 1.65/6.49  % EPR                                   7
% 1.65/6.49  % Horn                                  4
% 1.65/6.49  % unary                                 4
% 1.65/6.49  % binary                                0
% 1.65/6.49  % lits                                  13
% 1.65/6.49  % lits eq                               0
% 1.65/6.49  % fd_pure                               0
% 1.65/6.49  % fd_pseudo                             0
% 1.65/6.49  % fd_cond                               0
% 1.65/6.49  % fd_pseudo_cond                        0
% 1.65/6.49  % AC symbols                            0
% 1.65/6.49  
% 1.65/6.49  % ------ Schedule EPR non Horn non eq is on
% 1.65/6.49  
% 1.65/6.49  % ------ no equalities: superposition off 
% 1.65/6.49  
% 1.65/6.49  % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 1.65/6.49  
% 1.65/6.49  
% 1.65/6.49  % ------ 
% 1.65/6.49  % Current options:
% 1.65/6.49  % ------ 
% 1.65/6.49  
% 1.65/6.49  
% 1.65/6.49  % 
% 1.65/6.49  
% 1.65/6.49  % ------ Proving...
% 1.65/6.49  % 
% 1.65/6.49  
% 1.65/6.49  % SZS status Theorem for theBenchmark.p
% 1.65/6.49  
% 1.65/6.49  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.65/6.50  
% 1.65/6.50  
%------------------------------------------------------------------------------