↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : GEO241+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n016.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 : Tue Sep 29 09:54:12 AM UTC 2026

% Result   : Theorem 0.33s 20.52s
% Output   : Refutation 0.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   24 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   22 (   8   ~;   1   |;  10   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (  15   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,axiom,
    ! [X0,X1] :
      ~ ( left_convergent_lines(X0,X1)
        | left_convergent_lines(X0,reverse_line(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).

fof(f37,conjecture,
    ! [X0,X1,X2] :
      ( ( incident_point_and_line(X0,X2)
        & distinct_points(X0,X1)
        & left_convergent_lines(X2,line_connecting(X0,X1)) )
     => left_apart_point(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(f38,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( incident_point_and_line(X0,X2)
          & distinct_points(X0,X1)
          & left_convergent_lines(X2,line_connecting(X0,X1)) )
       => left_apart_point(X1,X2) ),
    inference(negated_conjecture,[status(cth)],[f37]) ).

fof(f42,plain,
    ~ ! [X0,X1,X2] :
        ( ( distinct_points(X0,X1)
          & left_convergent_lines(X2,line_connecting(X0,X1)) )
       => left_apart_point(X1,X2) ),
    inference(pure_predicate_removal,[],[f38]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ~ left_convergent_lines(X0,X1)
      & ~ left_convergent_lines(X0,reverse_line(X1)) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f79,plain,
    ? [X0,X1,X2] :
      ( ~ left_apart_point(X1,X2)
      & distinct_points(X0,X1)
      & left_convergent_lines(X2,line_connecting(X0,X1)) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f80,plain,
    ? [X0,X1,X2] :
      ( ~ left_apart_point(X1,X2)
      & distinct_points(X0,X1)
      & left_convergent_lines(X2,line_connecting(X0,X1)) ),
    inference(flattening,[],[f79]) ).

fof(f100,plain,
    ! [X0,X1] : ~ left_convergent_lines(X0,X1),
    inference(cnf_transformation,[],[f57]) ).

fof(f118,plain,
    left_convergent_lines(sK2,line_connecting(sK0,sK1)),
    inference(cnf_transformation,[],[f80]) ).

fof(f155,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f118,f100]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO241+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42   % Computer : n016.cluster.edu
% 0.13/0.42   % Model    : x86_64 x86_64
% 0.13/0.42   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42   % Memory   : 8046.5625MB
% 0.13/0.42   % OS       : Linux 6.8.0-71-generic
% 0.09/20.45  % CPULimit : 300
% 0.09/20.45  % WCLimit  : 300
% 0.09/20.45  % DateTime : Sun Sep 27 07:50:36 UTC 2026
% 0.09/20.45  % CPUTime  : 
% 0.09/20.45  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/20.48  Running first-order model finding
% 0.09/20.48  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.33/20.52  % (900049)Will run a generic schedule for satisfiability detection.
% 0.33/20.52  % (900055)% WARNING: option uhcvi not known.
% 0.33/20.52  % (900055)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1295967128:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.33/20.52  % (900055) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-900049-900055"...
% 0.33/20.52  % (900055)...printing done.
% 0.33/20.52  % (900055)Refutation found. Thanks to Tanya!
% 0.33/20.52  % SZS status Theorem for theBenchmark
% 0.33/20.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.33/20.52  % (900055)------------------------------
% 0.33/20.52  % (900055)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/20.52  % (900055)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/20.52  % (900055)CaDiCaL version: 2.1.3
% 0.33/20.52  % (900055)Termination reason: Refutation
% 0.33/20.52  % (900055)Time elapsed: 0.001 s
% 0.33/20.52  % (900055)Peak memory usage: 12 MB
% 0.33/20.52  % (900055)Instructions burned: 1 (million)
% 0.33/20.52  % (900049)Success in time 0.032 s
% 0.33/20.53  % Vampire exiting
%------------------------------------------------------------------------------