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

% Computer : n017.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:27 AM UTC 2026

% Result   : Theorem 0.16s 0.51s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   35 (   8 unt;   0 def)
%            Number of atoms       :  156 (  57 equ)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :  200 (  79   ~;  78   |;  42   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   62 (  51   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X0] :
      ( ron(vd1399,X0)
      & ron(vd1401,X0)
      & rline(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(thee(the(408), 1))') ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
        ( ron(vd1399,X0)
        & ron(vd1401,X0)
        & rline(X0) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f9,axiom,
    ( vd1406 = vd1407
    & ron(vd1400,vd1406)
    & ron(vd1399,vd1406)
    & rline(vd1407)
    & vd1400 != vd1401
    & vd1399 != vd1401
    & vd1399 != vd1400
    & ? [X0] :
        ( vd1401 = X0
        & rpoint(X0) )
    & ? [X1] :
        ( vd1400 = X1
        & rpoint(X1) )
    & ? [X2] :
        ( vd1399 = X2
        & rpoint(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(conjunct2(405), 5), and(pred(s2(plural(conjunct2(405))), 0), and(pred(s1(plural(conjunct2(405))), 0), and(pred(conjunct2(405), 1), and(pred(conjunct1(405), 9), and(pred(conjunct1(405), 8), and(pred(conjunct1(405), 7), and(qe(s3(plural(405))), and(qe(s2(plural(405))), qe(s1(plural(405))))))))))))') ).

fof(f36,axiom,
    ! [X0,X1] :
      ( ( X0 != X1
        & ? [X2] :
            ( X1 = X2
            & rpoint(X2) )
        & ? [X3] :
            ( X0 = X3
            & rpoint(X3) ) )
     => ? [X4] :
          ( ron(X1,X4)
          & ron(X0,X4)
          & rline(X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(51), 0), imp(cond(axiom(51), 0)))') ).

fof(f130,plain,
    ! [X0] :
      ( ~ ron(vd1399,X0)
      | ~ ron(vd1401,X0)
      | ~ rline(X0) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f183,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( ron(X1,X4)
          & ron(X0,X4)
          & rline(X4) )
      | X0 = X1
      | ! [X2] :
          ( X1 != X2
          | ~ rpoint(X2) )
      | ! [X3] :
          ( X0 != X3
          | ~ rpoint(X3) ) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f184,plain,
    ! [X0,X1] :
      ( ? [X4] :
          ( ron(X1,X4)
          & ron(X0,X4)
          & rline(X4) )
      | X0 = X1
      | ! [X2] :
          ( X1 != X2
          | ~ rpoint(X2) )
      | ! [X3] :
          ( X0 != X3
          | ~ rpoint(X3) ) ),
    inference(flattening,[],[f183]) ).

fof(f349,plain,
    ( vd1406 = vd1407
    & ron(vd1400,vd1406)
    & ron(vd1399,vd1406)
    & rline(vd1407)
    & vd1400 != vd1401
    & vd1399 != vd1401
    & vd1399 != vd1400
    & vd1401 = sK1
    & rpoint(sK1)
    & vd1400 = sK2
    & rpoint(sK2)
    & vd1399 = sK3
    & rpoint(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f9]) ).

fof(f362,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ron(X1,X2)
          & ron(X0,X2)
          & rline(X2) )
      | X0 = X1
      | ! [X3] :
          ( X1 != X3
          | ~ rpoint(X3) )
      | ! [X4] :
          ( X0 != X4
          | ~ rpoint(X4) ) ),
    inference(rectify,[],[f184]) ).

fof(f363,plain,
    ! [X0,X1] :
      ( ( ron(X1,sK8(X0,X1))
        & ron(X0,sK8(X0,X1))
        & rline(sK8(X0,X1)) )
      | X0 = X1
      | ! [X3] :
          ( X1 != X3
          | ~ rpoint(X3) )
      | ! [X4] :
          ( X0 != X4
          | ~ rpoint(X4) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0,X1))],[f362]) ).

fof(f427,plain,
    ! [X0] :
      ( ~ ron(vd1399,X0)
      | ~ ron(vd1401,X0)
      | ~ rline(X0) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f434,plain,
    rpoint(sK3),
    inference(cnf_transformation,[],[f349]) ).

fof(f435,plain,
    vd1399 = sK3,
    inference(cnf_transformation,[],[f349]) ).

fof(f438,plain,
    rpoint(sK1),
    inference(cnf_transformation,[],[f349]) ).

fof(f439,plain,
    vd1401 = sK1,
    inference(cnf_transformation,[],[f349]) ).

fof(f441,plain,
    vd1399 != vd1401,
    inference(cnf_transformation,[],[f349]) ).

fof(f489,plain,
    ! [X3,X0,X1,X4] :
      ( rline(sK8(X0,X1))
      | X0 = X1
      | X1 != X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(cnf_transformation,[],[f363]) ).

fof(f490,plain,
    ! [X3,X0,X1,X4] :
      ( ron(X0,sK8(X0,X1))
      | X0 = X1
      | X1 != X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(cnf_transformation,[],[f363]) ).

fof(f491,plain,
    ! [X3,X0,X1,X4] :
      ( ron(X1,sK8(X0,X1))
      | X0 = X1
      | X1 != X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(cnf_transformation,[],[f363]) ).

fof(f695,plain,
    ! [X0] :
      ( ~ ron(sK3,X0)
      | ~ ron(sK1,X0)
      | ~ rline(X0) ),
    inference(definition_unfolding,[],[f427,f435,f439]) ).

fof(f704,plain,
    sK1 != sK3,
    inference(definition_unfolding,[],[f441,f435,f439]) ).

fof(f883,plain,
    ! [X3,X0,X4] :
      ( ron(X3,sK8(X0,X3))
      | X0 = X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f491]) ).

fof(f884,plain,
    ! [X3,X4] :
      ( ron(X3,sK8(X4,X3))
      | X3 = X4
      | ~ rpoint(X3)
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f883]) ).

fof(f885,plain,
    ! [X3,X0,X4] :
      ( ron(X0,sK8(X0,X3))
      | X0 = X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f490]) ).

fof(f886,plain,
    ! [X3,X4] :
      ( ron(X4,sK8(X4,X3))
      | X3 = X4
      | ~ rpoint(X3)
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f885]) ).

fof(f887,plain,
    ! [X3,X0,X4] :
      ( rline(sK8(X0,X3))
      | X0 = X3
      | ~ rpoint(X3)
      | X0 != X4
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f489]) ).

fof(f888,plain,
    ! [X3,X4] :
      ( rline(sK8(X4,X3))
      | X3 = X4
      | ~ rpoint(X3)
      | ~ rpoint(X4) ),
    inference(equality_resolution,[],[f887]) ).

fof(f1791,plain,
    ! [X0] :
      ( sK3 = X0
      | ~ rpoint(sK3)
      | ~ rpoint(X0)
      | ~ ron(sK1,sK8(X0,sK3))
      | ~ rline(sK8(X0,sK3)) ),
    inference(resolution,[],[f884,f695]) ).

fof(f1792,plain,
    ! [X0] :
      ( sK3 = X0
      | ~ rpoint(sK3)
      | ~ rpoint(X0)
      | ~ ron(sK1,sK8(X0,sK3)) ),
    inference(forward_subsumption_resolution,[],[f1791,f888]) ).

fof(f1793,plain,
    ! [X0] :
      ( ~ ron(sK1,sK8(X0,sK3))
      | ~ rpoint(X0)
      | sK3 = X0 ),
    inference(forward_subsumption_resolution,[],[f1792,f434]) ).

fof(f1794,plain,
    ( sK1 = sK3
    | ~ rpoint(sK3)
    | ~ rpoint(sK1)
    | ~ rpoint(sK1)
    | sK1 = sK3 ),
    inference(resolution,[],[f886,f1793]) ).

fof(f1796,plain,
    ( sK1 = sK3
    | ~ rpoint(sK3)
    | ~ rpoint(sK1) ),
    inference(duplicate_literal_removal,[],[f1794]) ).

fof(f1798,plain,
    ( ~ rpoint(sK3)
    | ~ rpoint(sK1) ),
    inference(forward_subsumption_resolution,[],[f1796,f704]) ).

fof(f1800,plain,
    ~ rpoint(sK1),
    inference(forward_subsumption_resolution,[],[f1798,f434]) ).

fof(f1801,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1800,f438]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO342+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n017.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 08:03:50 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.51  % (2226980)Will run a generic schedule for satisfiability detection.
% 0.16/0.51  % (2226989)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1841099262:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.51  % (2226986)% WARNING: option uhcvi not known.
% 0.16/0.51  % (2226986)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3700669392:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.51  % (2226985)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=188314349_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.51  % (2226987)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1208695402:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.51  % (2226988)dis+10_1_sil=32000:sp=arity:random_seed=298463135:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.51  % (2226990)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1484685888:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.51  % (2226991)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=67641752:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.51  % (2226988) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2226980-2226988"...
% 0.16/0.51  % (2226988)...printing done.
% 0.16/0.51  % (2226989)Instruction limit reached! 
% 0.16/0.51  % (2226989)------------------------------
% 0.16/0.51  % (2226989)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.51  % (2226989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.51  % (2226989)CaDiCaL version: 2.1.3
% 0.16/0.51  % (2226989)Termination reason: Instruction limit
% 0.16/0.51  % (2226989)Termination phase: Saturation
% 0.16/0.51  % (2226989)Time elapsed: 0.032 s
% 0.16/0.51  % (2226989)Peak memory usage: 13 MB
% 0.16/0.51  % (2226989)Instructions burned: 118 (million)
% 0.16/0.51  % (2226988)Refutation found. Thanks to Tanya!
% 0.16/0.51  % SZS status Theorem for theBenchmark
% 0.16/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.52  % (2226988)------------------------------
% 0.16/0.52  % (2226988)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.52  % (2226988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.52  % (2226988)CaDiCaL version: 2.1.3
% 0.16/0.52  % (2226988)Termination reason: Refutation
% 0.16/0.52  % (2226988)Time elapsed: 0.023 s
% 0.16/0.52  % (2226988)Peak memory usage: 13 MB
% 0.16/0.52  % (2226988)Instructions burned: 42 (million)
% 0.16/0.52  % (2226980)Success in time 0.078 s
% 0.16/0.52  % Vampire exiting
%------------------------------------------------------------------------------