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

% Computer : n005.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:05 AM UTC 2026

% Result   : Theorem 0.14s 0.47s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   50 (  15 unt;   1 def)
%            Number of atoms       :  113 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  106 (  43   ~;  41   |;  14   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   64 (   0 sgn  58   !;   6   ?)

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

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

fof(f19,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | unorthogonal_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',occu1) ).

fof(f25,axiom,
    ! [X0,X1,X2] :
      ( ( ( ~ convergent_lines(X0,X1)
          | ~ unorthogonal_lines(X0,X1) )
        & ( ~ convergent_lines(X0,X2)
          | ~ unorthogonal_lines(X0,X2) ) )
     => ( ~ convergent_lines(X1,X2)
        | ~ unorthogonal_lines(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+4.ax',cotno1) ).

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

fof(f35,axiom,
    ! [X0,X1] :
      ( orthogonal_lines(X0,X1)
    <=> ~ unorthogonal_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a5) ).

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

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

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

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

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

fof(f65,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X1,X2)
      | ~ unorthogonal_lines(X1,X2)
      | ( convergent_lines(X0,X1)
        & unorthogonal_lines(X0,X1) )
      | ( convergent_lines(X0,X2)
        & unorthogonal_lines(X0,X2) ) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( ~ convergent_lines(X1,X2)
      | ~ unorthogonal_lines(X1,X2)
      | ( convergent_lines(X0,X1)
        & unorthogonal_lines(X0,X1) )
      | ( convergent_lines(X0,X2)
        & unorthogonal_lines(X0,X2) ) ),
    inference(flattening,[],[f65]) ).

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

fof(f78,plain,
    ? [X0,X1,X2] :
      ( ~ orthogonal_lines(X1,X2)
      & parallel_lines(X0,X1)
      & orthogonal_lines(X0,X2) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f79,plain,
    ? [X0,X1,X2] :
      ( ~ orthogonal_lines(X1,X2)
      & parallel_lines(X0,X1)
      & orthogonal_lines(X0,X2) ),
    inference(flattening,[],[f78]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ( orthogonal_lines(X0,X1)
        | unorthogonal_lines(X0,X1) )
      & ( ~ unorthogonal_lines(X0,X1)
        | ~ orthogonal_lines(X0,X1) ) ),
    inference(nnf_transformation,[],[f35]) ).

fof(f81,plain,
    ( ~ orthogonal_lines(sK1,sK2)
    & parallel_lines(sK0,sK1)
    & orthogonal_lines(sK0,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f79]) ).

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

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

fof(f100,plain,
    ! [X0,X1] :
      ( unorthogonal_lines(X0,X1)
      | convergent_lines(X0,X1) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f111,plain,
    ! [X2,X0,X1] :
      ( ~ unorthogonal_lines(X1,X2)
      | ~ convergent_lines(X1,X2)
      | convergent_lines(X0,X1)
      | unorthogonal_lines(X0,X2) ),
    inference(cnf_transformation,[],[f66]) ).

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

fof(f119,plain,
    ! [X0,X1] :
      ( ~ orthogonal_lines(X0,X1)
      | ~ unorthogonal_lines(X0,X1) ),
    inference(cnf_transformation,[],[f80]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( orthogonal_lines(X0,X1)
      | unorthogonal_lines(X0,X1) ),
    inference(cnf_transformation,[],[f80]) ).

fof(f121,plain,
    orthogonal_lines(sK0,sK2),
    inference(cnf_transformation,[],[f81]) ).

fof(f122,plain,
    parallel_lines(sK0,sK1),
    inference(cnf_transformation,[],[f81]) ).

fof(f123,plain,
    ~ orthogonal_lines(sK1,sK2),
    inference(cnf_transformation,[],[f81]) ).

fof(f125,plain,
    ~ convergent_lines(sK0,sK1),
    inference(resolution,[],[f118,f122]) ).

fof(f126,plain,
    ~ unorthogonal_lines(sK0,sK2),
    inference(resolution,[],[f119,f121]) ).

fof(f127,plain,
    unorthogonal_lines(sK1,sK2),
    inference(resolution,[],[f120,f123]) ).

fof(f129,plain,
    convergent_lines(sK0,sK2),
    inference(resolution,[],[f126,f100]) ).

fof(f131,plain,
    ! [X0] :
      ( convergent_lines(sK2,X0)
      | convergent_lines(sK0,X0) ),
    inference(resolution,[],[f87,f129]) ).

fof(f133,plain,
    ! [X0,X1] :
      ( convergent_lines(sK0,X0)
      | convergent_lines(X0,X1)
      | convergent_lines(sK2,X1) ),
    inference(resolution,[],[f131,f87]) ).

fof(f138,plain,
    ! [X0] :
      ( convergent_lines(sK0,X0)
      | convergent_lines(X0,sK2) ),
    inference(resolution,[],[f133,f84]) ).

fof(f179,definition,
    ( spl3_1
  <=> convergent_lines(sK1,sK2) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f180,plain,
    ( convergent_lines(sK1,sK2)
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f179]) ).

fof(f181,plain,
    ( ~ convergent_lines(sK1,sK2)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f179]) ).

fof(f186,plain,
    ( convergent_lines(sK0,sK1)
    | spl3_1 ),
    inference(resolution,[],[f181,f138]) ).

fof(f187,plain,
    ( $false
    | spl3_1 ),
    inference(forward_subsumption_resolution,[],[f186,f125]) ).

fof(f188,plain,
    spl3_1,
    inference(avatar_contradiction_clause,[],[f187]) ).

fof(f221,plain,
    ! [X0] :
      ( ~ convergent_lines(sK1,sK2)
      | convergent_lines(X0,sK1)
      | unorthogonal_lines(X0,sK2) ),
    inference(resolution,[],[f111,f127]) ).

fof(f226,plain,
    ( ! [X0] :
        ( unorthogonal_lines(X0,sK2)
        | convergent_lines(X0,sK1) )
    | ~ spl3_1 ),
    inference(forward_subsumption_resolution,[],[f221,f180]) ).

fof(f254,plain,
    ( convergent_lines(sK0,sK1)
    | ~ spl3_1 ),
    inference(resolution,[],[f226,f126]) ).

fof(f261,plain,
    ( $false
    | ~ spl3_1 ),
    inference(forward_subsumption_resolution,[],[f254,f125]) ).

fof(f262,plain,
    ~ spl3_1,
    inference(avatar_contradiction_clause,[],[f261]) ).

cnf(s2,plain,
    spl3_1,
    inference(sat_conversion,[],[f188]) ).

cnf(s5,plain,
    ~ spl3_1,
    inference(sat_conversion,[],[f262]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s2,s5]) ).

fof(f263,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO218+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n005.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 : Sun Sep 27 07:41:47 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  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.14/0.47  % (3658919)Will run a generic schedule for satisfiability detection.
% 0.14/0.47  % (3658925)% WARNING: option uhcvi not known.
% 0.14/0.47  % (3658925)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4261676145:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.47  % (3658924)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1623447106_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.47  % (3658926)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3405796243:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.47  % (3658927)dis+10_1_sil=32000:sp=arity:random_seed=2922852161:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.47  % (3658928)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3625571339:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.47  % (3658930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=383287082:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.47  % (3658929)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3475239148:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.47  % TRYING [1]
% 0.14/0.47  % TRYING [2]
% 0.14/0.47  % TRYING [3]
% 0.14/0.47  % TRYING [4]
% 0.14/0.47  % (3658927) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3658919-3658927"...
% 0.14/0.47  % (3658929) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3658919-3658929"...
% 0.14/0.47  % (3658927)...printing done.
% 0.14/0.47  % TRYING [5]
% 0.14/0.47  % (3658927)Refutation found. Thanks to Tanya!
% 0.14/0.47  % SZS status Theorem for theBenchmark
% 0.14/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.47  % (3658927)------------------------------
% 0.14/0.47  % (3658927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.47  % (3658927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.47  % (3658927)CaDiCaL version: 2.1.3
% 0.14/0.47  % (3658927)Termination reason: Refutation
% 0.14/0.47  % (3658927)Time elapsed: 0.005 s
% 0.14/0.47  % (3658927)Peak memory usage: 12 MB
% 0.14/0.47  % (3658927)Instructions burned: 6 (million)
% 0.14/0.47  % (3658919)Success in time 0.044 s
% 0.14/0.47  % Vampire exiting
%------------------------------------------------------------------------------