↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GEO219+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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:52:05 AM UTC 2026

% Result   : Theorem 3.65s 1.49s
% Output   : Refutation 3.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   41 (  11 unt;   0 def)
%            Number of atoms       :   97 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  102 (  46   ~;  33   |;  15   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   66 (  60   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [X0,X1,X2] :
      ( convergent_lines(X0,X1)
     => ( distinct_lines(X1,X2)
        | convergent_lines(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq3) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( distinct_lines(X0,X1)
     => convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).

fof(f24,axiom,
    ! [X0,X1] :
      ~ ( ~ convergent_lines(X0,X1)
        & ~ unorthogonal_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',coipo1) ).

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/theBenchmark.p',cotno1) ).

fof(f33,axiom,
    ! [X0,X1] :
      ( parallel_lines(X0,X1)
    <=> ~ convergent_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).

fof(f35,axiom,
    ! [X0,X1] :
      ( orthogonal_lines(X0,X1)
    <=> ~ unorthogonal_lines(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5) ).

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

fof(f37,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( orthogonal_lines(X0,X1)
          & parallel_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(f39,plain,
    ? [X0,X1,X2] :
      ( ~ orthogonal_lines(X1,X2)
      & orthogonal_lines(X0,X1)
      & parallel_lines(X0,X2) ),
    inference(ennf_transformation,[],[f37]) ).

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

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

fof(f46,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(f47,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,[],[f46]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( convergent_lines(X0,X1)
      | unorthogonal_lines(X0,X1) ),
    inference(ennf_transformation,[],[f24]) ).

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

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(f62,plain,
    ( ~ orthogonal_lines(sK1,sK2)
    & orthogonal_lines(sK0,sK1)
    & parallel_lines(sK0,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f40]) ).

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

fof(f64,plain,
    parallel_lines(sK0,sK2),
    inference(cnf_transformation,[],[f62]) ).

fof(f65,plain,
    orthogonal_lines(sK0,sK1),
    inference(cnf_transformation,[],[f62]) ).

fof(f66,plain,
    ~ orthogonal_lines(sK1,sK2),
    inference(cnf_transformation,[],[f62]) ).

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

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

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

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

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

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

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

fof(f90,plain,
    ~ convergent_lines(sK0,sK2),
    inference(resolution,[],[f67,f64]) ).

fof(f91,plain,
    ~ unorthogonal_lines(sK0,sK1),
    inference(resolution,[],[f68,f65]) ).

fof(f92,plain,
    unorthogonal_lines(sK1,sK2),
    inference(resolution,[],[f69,f66]) ).

fof(f94,plain,
    convergent_lines(sK0,sK1),
    inference(resolution,[],[f77,f91]) ).

fof(f105,plain,
    ! [X0] :
      ( distinct_lines(X0,sK2)
      | ~ convergent_lines(sK0,X0) ),
    inference(resolution,[],[f86,f90]) ).

fof(f121,plain,
    ! [X0] :
      ( convergent_lines(sK0,X0)
      | ~ convergent_lines(sK1,X0)
      | ~ unorthogonal_lines(sK1,X0) ),
    inference(resolution,[],[f74,f91]) ).

fof(f122,plain,
    ( ~ convergent_lines(sK1,sK2)
    | ~ unorthogonal_lines(sK1,sK2) ),
    inference(resolution,[],[f121,f90]) ).

fof(f124,plain,
    ~ convergent_lines(sK1,sK2),
    inference(forward_subsumption_resolution,[],[f122,f92]) ).

fof(f129,plain,
    ~ distinct_lines(sK1,sK2),
    inference(resolution,[],[f124,f85]) ).

fof(f140,plain,
    ~ convergent_lines(sK0,sK1),
    inference(resolution,[],[f129,f105]) ).

fof(f142,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f140,f94]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO219+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n005.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 07:42:02 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/1.49  % (3659359)Detected formulas, will run a generic FOF schedule.
% 3.65/1.49  % (3659367)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1981344711:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.65/1.49  % (3659367)Refutation not found, incomplete strategy
% 3.65/1.49  % (3659367)------------------------------
% 3.65/1.49  % (3659367)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.49  % (3659367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.49  % (3659367)CaDiCaL version: 2.1.3
% 3.65/1.49  % (3659367)Termination reason: Refutation not found, incomplete strategy
% 3.65/1.49  % (3659367)Time elapsed: 0.001 s
% 3.65/1.49  % (3659367)Peak memory usage: 87 MB
% 3.65/1.49  % (3659365)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2276461032:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.65/1.49  % (3659364)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3213954549:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.65/1.49  % (3659369)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2241170925:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.65/1.49  % (3659366)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2999826412:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.65/1.49  % (3659370)dis-21_1_sil=8000:lcm=predicate:random_seed=2590141587:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.65/1.49  % (3659368)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4183028037:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.65/1.49  % (3659368)First to succeed.
% 3.65/1.49  % (3659368)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3659359"
% 3.65/1.49  % (3659370)Also succeeded, but the first one will report.
% 3.65/1.49  % (3659369)Also succeeded, but the first one will report.
% 3.65/1.49  % (3659367)------------------------------
% 3.65/1.49  % (3659367)------------------------------
% 3.65/1.49  % (3659368)Refutation found. Thanks to Tanya!
% 3.65/1.49  % SZS status Theorem for theBenchmark
% 3.65/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.49  % (3659368)------------------------------
% 3.65/1.49  % (3659368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.49  % (3659368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.49  % (3659368)CaDiCaL version: 2.1.3
% 3.65/1.49  % (3659368)Termination reason: Refutation
% 3.65/1.49  % (3659368)Time elapsed: 0.003 s
% 3.65/1.49  % (3659368)Peak memory usage: 88 MB
% 3.65/1.49  % (3659368)Instructions burned: 2 (million)
% 3.65/1.49  % (3659368)------------------------------
% 3.65/1.49  % (3659368)------------------------------
% 3.65/1.49  % (3659359)Success in time 0.435 s
% 3.65/1.49  % Vampire exiting
%------------------------------------------------------------------------------