↑ 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  : GEO237+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 : n018.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:11 AM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   4 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   33 (  12   ~;   7   |;   9   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   34 (  26   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0,X1,X2] :
      ( divides_points(X2,X0,X1)
    <=> ( ( left_apart_point(X0,X2)
          & right_apart_point(X1,X2) )
        | ( right_apart_point(X0,X2)
          & left_apart_point(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a8_defns) ).

fof(f20,axiom,
    ! [X0,X1] :
      ~ ( left_apart_point(X0,X1)
        | left_apart_point(X0,reverse_line(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).

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

fof(f38,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( apart_point_and_line(X2,X3)
       => ( divides_points(X3,X0,X1)
         => ( divides_points(X3,X0,X2)
            | divides_points(X3,X1,X2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f37]) ).

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

fof(f74,plain,
    ? [X0,X1,X2,X3] :
      ( ~ divides_points(X3,X0,X2)
      & ~ divides_points(X3,X1,X2)
      & divides_points(X3,X0,X1)
      & apart_point_and_line(X2,X3) ),
    inference(ennf_transformation,[],[f38]) ).

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

fof(f86,plain,
    ! [X2,X0,X1] :
      ( left_apart_point(X1,X2)
      | left_apart_point(X0,X2)
      | ~ divides_points(X2,X0,X1) ),
    inference(cnf_transformation,[],[f8]) ).

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

fof(f122,plain,
    divides_points(sK3,sK0,sK1),
    inference(cnf_transformation,[],[f75]) ).

fof(f129,plain,
    ! [X2,X0,X1] :
      ( left_apart_point(X0,X2)
      | ~ divides_points(X2,X0,X1) ),
    inference(forward_subsumption_resolution,[],[f86,f101]) ).

fof(f133,plain,
    ! [X2,X0,X1] : ~ divides_points(X2,X0,X1),
    inference(forward_subsumption_resolution,[],[f129,f101]) ).

fof(f134,plain,
    $false,
    inference(resolution,[],[f133,f122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO237+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.12/0.38  % Computer : n018.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 07:50:39 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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.17/0.47  % (2002953)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (2002962)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1869898180:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47  % (2002962) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2002953-2002962"...
% 0.17/0.47  % (2002962)...printing done.
% 0.17/0.47  % (2002962)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (2002962)------------------------------
% 0.17/0.47  % (2002962)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (2002962)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (2002962)CaDiCaL version: 2.1.3
% 0.17/0.47  % (2002962)Termination reason: Refutation
% 0.17/0.47  % (2002962)Time elapsed: 0.002 s
% 0.17/0.47  % (2002962)Peak memory usage: 12 MB
% 0.17/0.47  % (2002962)Instructions burned: 4 (million)
% 0.17/0.47  % (2002953)Success in time 0.043 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------