↑ 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  : GEO198+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 : n004.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:53:57 AM UTC 2026

% Result   : Theorem 0.26s 0.49s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  11 unt;   0 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   62 (  21   ~;  21   |;  14   &)
%                                         (   1 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   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   :   65 (  59   !;   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(f13,axiom,
    ! [X0,X1,X2] :
      ( apart_point_and_line(X0,X1)
     => ( distinct_lines(X1,X2)
        | apart_point_and_line(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).

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(f17,axiom,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp2) ).

fof(f34,axiom,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
    <=> ~ apart_point_and_line(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).

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

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

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

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

fof(f52,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f53,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(flattening,[],[f52]) ).

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

fof(f76,plain,
    ? [X0,X1,X2] :
      ( ~ incident_point_and_line(intersection_point(X0,X2),X1)
      & convergent_lines(X0,X1)
      & convergent_lines(X2,X1)
      & convergent_lines(X0,X2)
      & incident_point_and_line(intersection_point(X0,X1),X2) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f77,plain,
    ? [X0,X1,X2] :
      ( ~ incident_point_and_line(intersection_point(X0,X2),X1)
      & convergent_lines(X0,X1)
      & convergent_lines(X2,X1)
      & convergent_lines(X0,X2)
      & incident_point_and_line(intersection_point(X0,X1),X2) ),
    inference(flattening,[],[f76]) ).

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

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

fof(f90,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X1,X2)
      | apart_point_and_line(X0,X2)
      | ~ apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f53]) ).

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

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

fof(f94,plain,
    ! [X0,X1] : ~ apart_point_and_line(X0,parallel_through_point(X1,X0)),
    inference(cnf_transformation,[],[f17]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
      | apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f34]) ).

fof(f120,plain,
    ~ incident_point_and_line(intersection_point(sK0,sK2),sK1),
    inference(cnf_transformation,[],[f77]) ).

fof(f122,plain,
    apart_point_and_line(intersection_point(sK0,sK2),sK1),
    inference(resolution,[],[f114,f120]) ).

fof(f165,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X2,parallel_through_point(X0,X1))
      | convergent_lines(X2,X0) ),
    inference(resolution,[],[f83,f93]) ).

fof(f181,plain,
    ! [X2,X0,X1] :
      ( apart_point_and_line(X0,X1)
      | ~ apart_point_and_line(X0,X2)
      | convergent_lines(X2,X1) ),
    inference(resolution,[],[f90,f92]) ).

fof(f566,plain,
    ! [X0] :
      ( apart_point_and_line(intersection_point(sK0,sK2),X0)
      | convergent_lines(sK1,X0) ),
    inference(resolution,[],[f181,f122]) ).

fof(f583,plain,
    ! [X0] : convergent_lines(sK1,parallel_through_point(X0,intersection_point(sK0,sK2))),
    inference(resolution,[],[f566,f94]) ).

fof(f852,plain,
    ! [X0] : convergent_lines(sK1,X0),
    inference(resolution,[],[f583,f165]) ).

fof(f899,plain,
    $false,
    inference(resolution,[],[f852,f80]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO198+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.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 07:33:36 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.26/0.49  % (3175923)Will run a generic schedule for satisfiability detection.
% 0.26/0.49  % (3175933)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3122107840:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.26/0.49  % (3175929)% WARNING: option uhcvi not known.
% 0.26/0.49  % (3175928)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3617325090_2999 on theBenchmark for (2999ds/0Mi)
% 0.26/0.49  % (3175929)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1863211505:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.26/0.49  % (3175930)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=124607892:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.26/0.49  % (3175931)dis+10_1_sil=32000:sp=arity:random_seed=1769428225:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.26/0.49  % (3175932)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3312925541:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.26/0.49  % (3175934)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1203618076:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.26/0.49  % TRYING [1]
% 0.26/0.49  % TRYING [2]
% 0.26/0.49  % TRYING [3]
% 0.26/0.49  % TRYING [4]
% 0.26/0.49  % TRYING [5]
% 0.26/0.49  % TRYING [6]
% 0.26/0.49  % TRYING [7]
% 0.26/0.49  % (3175932) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3175923-3175932"...
% 0.26/0.49  % (3175933)Instruction limit reached! 
% 0.26/0.49  % (3175933)------------------------------
% 0.26/0.49  % (3175933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.49  % (3175933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.49  % (3175933)CaDiCaL version: 2.1.3
% 0.26/0.49  % (3175933)Termination reason: Instruction limit
% 0.26/0.49  % (3175933)Termination phase: Saturation
% 0.26/0.49  % (3175933)Time elapsed: 0.041 s
% 0.26/0.49  % (3175933)Peak memory usage: 12 MB
% 0.26/0.49  % (3175933)Instructions burned: 133 (million)
% 0.26/0.49  % (3175932)...printing done.
% 0.26/0.49  % (3175932)Refutation found. Thanks to Tanya!
% 0.26/0.49  % SZS status Theorem for theBenchmark
% 0.26/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.49  % (3175932)------------------------------
% 0.26/0.49  % (3175932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.49  % (3175932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.49  % (3175932)CaDiCaL version: 2.1.3
% 0.26/0.49  % (3175932)Termination reason: Refutation
% 0.26/0.49  % (3175932)Time elapsed: 0.033 s
% 0.26/0.49  % (3175932)Peak memory usage: 12 MB
% 0.26/0.49  % (3175932)Instructions burned: 58 (million)
% 0.26/0.49  % (3175923)Success in time 0.073 s
% 0.26/0.49  % Vampire exiting
%------------------------------------------------------------------------------