↑ 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  : GEO206+3 : TPTP v9.3.1. Bugfixed v4.0.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:00 AM UTC 2026

% Result   : Theorem 0.10s 0.46s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (   9 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   52 (  21   ~;  15   |;   8   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   52 (  46   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X1)
     => ( distinct_lines(X0,X2)
        | distinct_lines(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
     => convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).

fof(f16,axiom,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).

fof(f32,axiom,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
    <=> ~ distinct_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax2) ).

fof(f33,axiom,
    ! [X0,X1] :
      ( parallel_lines(X0,X1)
    <=> ~ convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a3) ).

fof(f36,conjecture,
    ! [X0,X1,X2] :
      ( ( incident_point_and_line(X0,X1)
        & parallel_lines(X1,X2) )
     => equal_lines(X1,parallel_through_point(X2,X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f37,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( incident_point_and_line(X0,X1)
          & parallel_lines(X1,X2) )
       => equal_lines(X1,parallel_through_point(X2,X0)) ),
    inference(negated_conjecture,[status(cth)],[f36]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( parallel_lines(X0,X1)
     => ~ convergent_lines(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f33]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( ~ distinct_lines(X0,X1)
     => equal_lines(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f32]) ).

fof(f43,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f44,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X0,X2)
      | distinct_lines(X1,X2)
      | ~ distinct_lines(X0,X1) ),
    inference(flattening,[],[f43]) ).

fof(f59,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | ~ distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
      | distinct_lines(X0,X1) ),
    inference(ennf_transformation,[],[f40]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ parallel_lines(X0,X1) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f82,plain,
    ? [X0,X1,X2] :
      ( ~ equal_lines(X1,parallel_through_point(X2,X0))
      & incident_point_and_line(X0,X1)
      & parallel_lines(X1,X2) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f83,plain,
    ? [X0,X1,X2] :
      ( ~ equal_lines(X1,parallel_through_point(X2,X0))
      & incident_point_and_line(X0,X1)
      & parallel_lines(X1,X2) ),
    inference(flattening,[],[f82]) ).

fof(f84,plain,
    ( ~ equal_lines(sK1,parallel_through_point(sK2,sK0))
    & incident_point_and_line(sK0,sK1)
    & parallel_lines(sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f83]) ).

fof(f89,plain,
    ! [X2,X0,X1] :
      ( ~ distinct_lines(X0,X1)
      | distinct_lines(X1,X2)
      | distinct_lines(X0,X2) ),
    inference(cnf_transformation,[],[f44]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( ~ distinct_lines(X0,X1)
      | convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f59]) ).

fof(f100,plain,
    ! [X0,X1] : ~ convergent_lines(parallel_through_point(X1,X0),X1),
    inference(cnf_transformation,[],[f16]) ).

fof(f121,plain,
    ! [X0,X1] :
      ( equal_lines(X0,X1)
      | distinct_lines(X0,X1) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f122,plain,
    ! [X0,X1] :
      ( ~ parallel_lines(X0,X1)
      | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f80]) ).

fof(f124,plain,
    parallel_lines(sK1,sK2),
    inference(cnf_transformation,[],[f84]) ).

fof(f126,plain,
    ~ equal_lines(sK1,parallel_through_point(sK2,sK0)),
    inference(cnf_transformation,[],[f84]) ).

fof(f142,plain,
    ~ convergent_lines(sK1,sK2),
    inference(resolution,[],[f124,f122]) ).

fof(f184,plain,
    distinct_lines(sK1,parallel_through_point(sK2,sK0)),
    inference(resolution,[],[f121,f126]) ).

fof(f223,plain,
    ! [X0] :
      ( distinct_lines(parallel_through_point(sK2,sK0),X0)
      | distinct_lines(sK1,X0) ),
    inference(resolution,[],[f89,f184]) ).

fof(f232,plain,
    ! [X0] :
      ( convergent_lines(parallel_through_point(sK2,sK0),X0)
      | distinct_lines(sK1,X0) ),
    inference(resolution,[],[f223,f99]) ).

fof(f244,plain,
    distinct_lines(sK1,sK2),
    inference(resolution,[],[f232,f100]) ).

fof(f248,plain,
    convergent_lines(sK1,sK2),
    inference(resolution,[],[f244,f99]) ).

fof(f249,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f248,f142]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO206+3 : TPTP v9.3.1. Bugfixed v4.0.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n019.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 07:36:49 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/0.41  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.46  % (2766915)Will run a generic schedule for satisfiability detection.
% 0.10/0.46  % (2766922)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=338955510:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46  % (2766922) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2766915-2766922"...
% 0.10/0.46  % (2766922)...printing done.
% 0.10/0.46  % (2766921)% WARNING: option uhcvi not known.
% 0.10/0.46  % (2766922)Refutation found. Thanks to Tanya!
% 0.10/0.46  % SZS status Theorem for theBenchmark
% 0.10/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46  % (2766922)------------------------------
% 0.10/0.46  % (2766922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46  % (2766922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46  % (2766922)CaDiCaL version: 2.1.3
% 0.10/0.46  % (2766922)Termination reason: Refutation
% 0.10/0.46  % (2766922)Time elapsed: 0.002 s
% 0.10/0.46  % (2766922)Peak memory usage: 12 MB
% 0.10/0.46  % (2766922)Instructions burned: 4 (million)
% 0.10/0.46  % (2766915)Success in time 0.039 s
% 0.10/0.46  % Vampire exiting
%------------------------------------------------------------------------------