↑ 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  : GEO172+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 : 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:53:47 AM UTC 2026

% Result   : Theorem 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   53 (  14 unt;   0 def)
%            Number of atoms       :  139 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  143 (  57   ~;  65   |;  11   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  101 (  95   !;   6   ?)

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

fof(f9,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
     => ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).

fof(f11,axiom,
    ! [X0,X1,X2,X3] :
      ( ( distinct_points(X0,X1)
        & distinct_lines(X2,X3) )
     => ( apart_point_and_line(X0,X2)
        | apart_point_and_line(X0,X3)
        | apart_point_and_line(X1,X2)
        | apart_point_and_line(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).

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

fof(f31,axiom,
    ! [X0,X1] :
      ( equal_points(X0,X1)
    <=> ~ distinct_points(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax1) ).

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)
        & incident_point_and_line(X2,X0)
        & incident_point_and_line(X2,X1) )
     => equal_points(X2,intersection_point(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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

fof(f38,plain,
    ! [X0,X1] :
      ( incident_point_and_line(X0,X1)
     => ~ apart_point_and_line(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f34]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ distinct_points(X0,X1)
     => equal_points(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f31]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
      | ~ convergent_lines(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f50,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X1,X3)
      | ~ distinct_points(X0,X1)
      | ~ distinct_lines(X2,X3) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f51,plain,
    ! [X0,X1,X2,X3] :
      ( apart_point_and_line(X0,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X1,X3)
      | ~ distinct_points(X0,X1)
      | ~ distinct_lines(X2,X3) ),
    inference(flattening,[],[f50]) ).

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

fof(f57,plain,
    ! [X0,X1,X2] :
      ( distinct_lines(X1,X2)
      | convergent_lines(X0,X2)
      | ~ convergent_lines(X0,X1) ),
    inference(flattening,[],[f56]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( equal_points(X0,X1)
      | distinct_points(X0,X1) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f79,plain,
    ! [X0,X1] :
      ( ~ apart_point_and_line(X0,X1)
      | ~ incident_point_and_line(X0,X1) ),
    inference(ennf_transformation,[],[f38]) ).

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

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

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

fof(f90,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
    inference(cnf_transformation,[],[f48]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
    inference(cnf_transformation,[],[f49]) ).

fof(f92,plain,
    ! [X2,X3,X0,X1] :
      ( ~ distinct_lines(X2,X3)
      | ~ distinct_points(X0,X1)
      | apart_point_and_line(X1,X3)
      | apart_point_and_line(X1,X2)
      | apart_point_and_line(X0,X3)
      | apart_point_and_line(X0,X2) ),
    inference(cnf_transformation,[],[f51]) ).

fof(f95,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,X1)
      | convergent_lines(X0,X2)
      | distinct_lines(X1,X2) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f118,plain,
    ! [X0,X1] :
      ( distinct_points(X0,X1)
      | equal_points(X0,X1) ),
    inference(cnf_transformation,[],[f78]) ).

fof(f119,plain,
    ! [X0,X1] :
      ( ~ incident_point_and_line(X0,X1)
      | ~ apart_point_and_line(X0,X1) ),
    inference(cnf_transformation,[],[f79]) ).

fof(f120,plain,
    incident_point_and_line(sK2,sK1),
    inference(cnf_transformation,[],[f81]) ).

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

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

fof(f123,plain,
    ~ equal_points(sK2,intersection_point(sK0,sK1)),
    inference(cnf_transformation,[],[f81]) ).

fof(f126,plain,
    ! [X0] : convergent_lines(X0,X0),
    inference(consistent_polarity_flipping,[],[f84]) ).

fof(f132,plain,
    ! [X0,X1] :
      ( apart_point_and_line(intersection_point(X0,X1),X0)
      | convergent_lines(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f90]) ).

fof(f133,plain,
    ! [X0,X1] :
      ( apart_point_and_line(intersection_point(X0,X1),X1)
      | convergent_lines(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f91]) ).

fof(f134,plain,
    ! [X2,X3,X0,X1] :
      ( ~ apart_point_and_line(X1,X3)
      | distinct_points(X0,X1)
      | distinct_lines(X2,X3)
      | ~ apart_point_and_line(X1,X2)
      | ~ apart_point_and_line(X0,X3)
      | ~ apart_point_and_line(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f92]) ).

fof(f137,plain,
    ! [X2,X0,X1] :
      ( ~ convergent_lines(X0,X2)
      | convergent_lines(X0,X1)
      | ~ distinct_lines(X1,X2) ),
    inference(consistent_polarity_flipping,[],[f95]) ).

fof(f160,plain,
    ! [X0,X1] :
      ( ~ equal_points(X0,X1)
      | ~ distinct_points(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f118]) ).

fof(f161,plain,
    ! [X0,X1] :
      ( ~ incident_point_and_line(X0,X1)
      | apart_point_and_line(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f119]) ).

fof(f162,plain,
    equal_points(sK2,intersection_point(sK0,sK1)),
    inference(consistent_polarity_flipping,[],[f123]) ).

fof(f163,plain,
    ~ convergent_lines(sK0,sK1),
    inference(consistent_polarity_flipping,[],[f122]) ).

fof(f167,plain,
    ~ distinct_points(sK2,intersection_point(sK0,sK1)),
    inference(resolution,[],[f160,f162]) ).

fof(f168,plain,
    apart_point_and_line(sK2,sK1),
    inference(resolution,[],[f161,f120]) ).

fof(f169,plain,
    apart_point_and_line(sK2,sK0),
    inference(resolution,[],[f161,f121]) ).

fof(f186,plain,
    ! [X0,X1] :
      ( ~ distinct_lines(X1,X0)
      | convergent_lines(X0,X1) ),
    inference(resolution,[],[f137,f126]) ).

fof(f230,plain,
    ! [X2,X3,X0,X1] :
      ( ~ apart_point_and_line(intersection_point(X1,X2),X3)
      | distinct_lines(X3,X1)
      | distinct_points(X0,intersection_point(X1,X2))
      | ~ apart_point_and_line(X0,X1)
      | ~ apart_point_and_line(X0,X3)
      | convergent_lines(X1,X2) ),
    inference(resolution,[],[f134,f132]) ).

fof(f302,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X0,X1)
      | distinct_points(X2,intersection_point(X1,X0))
      | ~ apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X2,X0)
      | convergent_lines(X1,X0)
      | convergent_lines(X1,X0) ),
    inference(resolution,[],[f230,f133]) ).

fof(f307,plain,
    ! [X2,X0,X1] :
      ( distinct_lines(X0,X1)
      | distinct_points(X2,intersection_point(X1,X0))
      | ~ apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X2,X0)
      | convergent_lines(X1,X0) ),
    inference(duplicate_literal_removal,[],[f302]) ).

fof(f309,plain,
    ! [X2,X0,X1] :
      ( distinct_points(X2,intersection_point(X1,X0))
      | ~ apart_point_and_line(X2,X1)
      | ~ apart_point_and_line(X2,X0)
      | convergent_lines(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f307,f186]) ).

fof(f443,plain,
    ( ~ apart_point_and_line(sK2,sK0)
    | ~ apart_point_and_line(sK2,sK1)
    | convergent_lines(sK0,sK1) ),
    inference(resolution,[],[f309,f167]) ).

fof(f447,plain,
    ( ~ apart_point_and_line(sK2,sK1)
    | convergent_lines(sK0,sK1) ),
    inference(forward_subsumption_resolution,[],[f443,f169]) ).

fof(f448,plain,
    convergent_lines(sK0,sK1),
    inference(forward_subsumption_resolution,[],[f447,f168]) ).

fof(f449,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f448,f163]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO172+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n018.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 07:24:39 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  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.17/0.48  % (1989418)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (1989425)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=109371094:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (1989424)% WARNING: option uhcvi not known.
% 0.17/0.48  % (1989423)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=500536761_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (1989424)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1888035595:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (1989426)dis+10_1_sil=32000:sp=arity:random_seed=731856833:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (1989427)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4167843922:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (1989428)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2203913469:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (1989429)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1387735041:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % TRYING [3]
% 0.17/0.48  % TRYING [4]
% 0.17/0.48  % TRYING [5]
% 0.17/0.48  % (1989424) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1989418-1989424"...
% 0.17/0.48  % (1989424)...printing done.
% 0.17/0.48  % (1989424)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Theorem for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (1989424)------------------------------
% 0.17/0.48  % (1989424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (1989424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (1989424)CaDiCaL version: 2.1.3
% 0.17/0.48  % (1989424)Termination reason: Refutation
% 0.17/0.48  % (1989424)Time elapsed: 0.010 s
% 0.17/0.48  % (1989424)Peak memory usage: 11 MB
% 0.17/0.48  % (1989424)Instructions burned: 13 (million)
% 0.17/0.48  % (1989418)Success in time 0.046 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------