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

% Computer : n026.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:04 AM UTC 2026

% Result   : Theorem 0.03s 5.48s
% Output   : Refutation 0.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   33 (  12 unt;   2 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   68 (  28   ~;  29   |;   6   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   41 (   0 sgn  35   !;   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(f18,conjecture,
    ! [X0,X1,X2] :
      ( ( ~ convergent_lines(X0,X1)
        & ~ convergent_lines(X0,X2) )
     => ~ convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( ~ convergent_lines(X0,X1)
          & ~ convergent_lines(X0,X2) )
       => ~ convergent_lines(X1,X2) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

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

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

fof(f43,plain,
    ? [X0,X1,X2] :
      ( convergent_lines(X1,X2)
      & ~ convergent_lines(X0,X1)
      & ~ convergent_lines(X0,X2) ),
    inference(ennf_transformation,[],[f19]) ).

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

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

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

fof(f65,plain,
    ~ convergent_lines(sK0,sK2),
    inference(cnf_transformation,[],[f44]) ).

fof(f66,plain,
    ~ convergent_lines(sK0,sK1),
    inference(cnf_transformation,[],[f44]) ).

fof(f67,plain,
    convergent_lines(sK1,sK2),
    inference(cnf_transformation,[],[f44]) ).

fof(f68,plain,
    ! [X0] :
      ( convergent_lines(sK2,X0)
      | convergent_lines(sK1,X0) ),
    inference(resolution,[],[f50,f67]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( convergent_lines(sK1,X0)
      | convergent_lines(X0,X1)
      | convergent_lines(sK2,X1) ),
    inference(resolution,[],[f68,f50]) ).

fof(f71,plain,
    ! [X2,X0,X1] :
      ( convergent_lines(X0,X1)
      | convergent_lines(sK2,X1)
      | convergent_lines(X0,X2)
      | convergent_lines(sK1,X2) ),
    inference(resolution,[],[f70,f50]) ).

fof(f139,definition,
    ( spl3_3
  <=> ! [X0] :
        ( convergent_lines(X0,sK2)
        | convergent_lines(X0,sK1) ) ),
    introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).

fof(f140,plain,
    ( ! [X0] :
        ( convergent_lines(X0,sK2)
        | convergent_lines(X0,sK1) )
    | ~ spl3_3 ),
    inference(avatar_component_clause,[],[f139]) ).

fof(f168,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,sK2)
      | convergent_lines(X0,X1)
      | convergent_lines(sK1,X1) ),
    inference(resolution,[],[f71,f47]) ).

fof(f199,definition,
    ( spl3_7
  <=> ! [X0,X1] :
        ( convergent_lines(X0,sK2)
        | convergent_lines(sK1,X1)
        | convergent_lines(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).

fof(f200,plain,
    ( ! [X0,X1] :
        ( convergent_lines(X0,sK2)
        | convergent_lines(sK1,X1)
        | convergent_lines(X0,X1) )
    | ~ spl3_7 ),
    inference(avatar_component_clause,[],[f199]) ).

fof(f202,plain,
    spl3_7,
    inference(avatar_split_clause,[],[f168,f199]) ).

fof(f697,plain,
    ( ! [X0] :
        ( convergent_lines(X0,sK2)
        | convergent_lines(X0,sK1) )
    | ~ spl3_7 ),
    inference(resolution,[],[f200,f47]) ).

fof(f724,plain,
    ( spl3_3
    | ~ spl3_7 ),
    inference(avatar_split_clause,[],[f697,f199,f139]) ).

fof(f725,plain,
    ( convergent_lines(sK0,sK1)
    | ~ spl3_3 ),
    inference(resolution,[],[f140,f65]) ).

fof(f737,plain,
    ( $false
    | ~ spl3_3 ),
    inference(forward_subsumption_resolution,[],[f725,f66]) ).

fof(f738,plain,
    ~ spl3_3,
    inference(avatar_contradiction_clause,[],[f737]) ).

cnf(s5,plain,
    spl3_7,
    inference(sat_conversion,[],[f202]) ).

cnf(s65,plain,
    ( spl3_3
    | ~ spl3_7 ),
    inference(sat_conversion,[],[f724]) ).

cnf(s66,plain,
    ~ spl3_3,
    inference(sat_conversion,[],[f738]) ).

cnf(s67,plain,
    ~ spl3_7,
    inference(rat,[],[s65,s66]) ).

cnf(s69,plain,
    $false,
    inference(rat,[],[s5,s67]) ).

fof(f739,plain,
    $false,
    inference(avatar_sat_refutation,[],[s69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO217+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/5.40  % Computer : n026.cluster.edu
% 0.03/5.40  % Model    : x86_64 x86_64
% 0.03/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.40  % Memory   : 8046.5625MB
% 0.03/5.40  % OS       : Linux 6.8.0-71-generic
% 0.03/5.40  % CPULimit : 300
% 0.03/5.40  % WCLimit  : 300
% 0.03/5.40  % DateTime : Sun Sep 27 07:44:31 UTC 2026
% 0.03/5.40  % CPUTime  : 
% 0.03/5.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/5.43  Running first-order model finding
% 0.03/5.43  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.03/5.48  % (2502955)Will run a generic schedule for satisfiability detection.
% 0.03/5.48  % (2502961)% WARNING: option uhcvi not known.
% 0.03/5.48  % (2502961)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4052415437:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.03/5.48  % (2502960)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1562502781_2999 on theBenchmark for (2999ds/0Mi)
% 0.03/5.48  % (2502962)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2792486719:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.03/5.48  % (2502965)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4138911854:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.03/5.48  % (2502963)dis+10_1_sil=32000:sp=arity:random_seed=1128780123:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.03/5.48  % (2502964)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2092911419:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.03/5.48  % (2502966)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1774288583:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.03/5.48  % TRYING [1]
% 0.03/5.48  % TRYING [2]
% 0.03/5.48  % TRYING [3]
% 0.03/5.48  % (2502961) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2502955-2502961"...
% 0.03/5.48  % TRYING [4]
% 0.03/5.48  % (2502966) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2502955-2502966"...
% 0.03/5.48  % (2502962) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2502955-2502962"...
% 0.03/5.48  % (2502961)...printing done.
% 0.03/5.48  % (2502961)Refutation found. Thanks to Tanya!
% 0.03/5.48  % SZS status Theorem for theBenchmark
% 0.03/5.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.03/5.48  % (2502961)------------------------------
% 0.03/5.48  % (2502961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.03/5.48  % (2502961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.03/5.48  % (2502961)CaDiCaL version: 2.1.3
% 0.03/5.48  % (2502961)Termination reason: Refutation
% 0.03/5.48  % (2502961)Time elapsed: 0.009 s
% 0.03/5.48  % (2502961)Peak memory usage: 12 MB
% 0.03/5.48  % (2502961)Instructions burned: 27 (million)
% 0.03/5.48  % (2502955)Success in time 0.04 s
% 0.03/5.48  % Vampire exiting
%------------------------------------------------------------------------------