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

% Computer : n019.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:44:21 AM UTC 2026

% Result   : Theorem 0.37s 0.30s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :   73 (  27 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   76 (  34   ~;  28   |;  11   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   37 (  37   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X0,X1,X2] :
      ( ( happens(X0,X1)
        & initiates(X0,X2,X1) )
     => holdsAt(X2,plus(X1,n1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_holds) ).

fof(f13,axiom,
    ! [X0,X1,X2] :
      ( initiates(X0,X1,X2)
    <=> ( ( X0 = push
          & X1 = forwards
          & ~ happens(pull,X2) )
        | ( X0 = pull
          & X1 = backwards
          & ~ happens(push,X2) )
        | ( X0 = pull
          & X1 = spinning
          & happens(push,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( happens(X0,X1)
    <=> ( ( X0 = push
          & X1 = n0 )
        | ( X0 = pull
          & X1 = n1 )
        | ( X0 = pull
          & X1 = n2 )
        | ( X0 = push
          & X1 = n2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).

fof(f26,axiom,
    plus(n1,n2) = n3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).

fof(f31,axiom,
    ! [X0,X1] : plus(X0,X1) = plus(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).

fof(f48,conjecture,
    holdsAt(spinning,n3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',spinning_3) ).

fof(f49,negated_conjecture,
    ~ holdsAt(spinning,n3),
    inference(negated_conjecture,[status(cth)],[f48]) ).

fof(f50,plain,
    ~ holdsAt(spinning,n3),
    inference(flattening,[],[f49]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( holdsAt(X2,plus(X1,n1))
      | ~ happens(X0,X1)
      | ~ initiates(X0,X2,X1) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f66,plain,
    ! [X0,X1,X2] :
      ( holdsAt(X2,plus(X1,n1))
      | ~ happens(X0,X1)
      | ~ initiates(X0,X2,X1) ),
    inference(flattening,[],[f65]) ).

fof(f82,plain,
    ! [X2,X0,X1] :
      ( ~ initiates(X0,X2,X1)
      | ~ happens(X0,X1)
      | holdsAt(X2,plus(X1,n1)) ),
    inference(cnf_transformation,[],[f66]) ).

fof(f100,plain,
    ! [X2,X0,X1] :
      ( ~ happens(push,X2)
      | spinning != X1
      | pull != X0
      | initiates(X0,X1,X2) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f146,plain,
    ! [X0,X1] :
      ( n2 != X1
      | pull != X0
      | happens(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f147,plain,
    ! [X0,X1] :
      ( n2 != X1
      | push != X0
      | happens(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f158,plain,
    n3 = plus(n1,n2),
    inference(cnf_transformation,[],[f26]) ).

fof(f163,plain,
    ! [X0,X1] : plus(X0,X1) = plus(X1,X0),
    inference(cnf_transformation,[],[f31]) ).

fof(f193,plain,
    ~ holdsAt(spinning,n3),
    inference(cnf_transformation,[],[f50]) ).

fof(f194,plain,
    ! [X2,X0] :
      ( ~ happens(push,X2)
      | pull != X0
      | initiates(X0,spinning,X2) ),
    inference(equality_resolution,[],[f100]) ).

fof(f195,plain,
    ! [X2] :
      ( initiates(pull,spinning,X2)
      | ~ happens(push,X2) ),
    inference(equality_resolution,[],[f194]) ).

fof(f212,plain,
    ! [X0] :
      ( push != X0
      | happens(X0,n2) ),
    inference(equality_resolution,[],[f147]) ).

fof(f213,plain,
    happens(push,n2),
    inference(equality_resolution,[],[f212]) ).

fof(f214,plain,
    ! [X0] :
      ( pull != X0
      | happens(X0,n2) ),
    inference(equality_resolution,[],[f146]) ).

fof(f215,plain,
    happens(pull,n2),
    inference(equality_resolution,[],[f214]) ).

fof(f230,plain,
    ! [X2,X0,X1] :
      ( ~ initiates(X0,X2,X1)
      | ~ happens(X0,X1)
      | ~ holdsAt(X2,plus(X1,n1)) ),
    inference(consistent_polarity_flipping,[],[f82]) ).

fof(f319,plain,
    holdsAt(spinning,n3),
    inference(consistent_polarity_flipping,[],[f193]) ).

fof(f507,plain,
    ! [X0] :
      ( ~ happens(pull,X0)
      | ~ holdsAt(spinning,plus(X0,n1))
      | ~ happens(push,X0) ),
    inference(resolution,[],[f230,f195]) ).

fof(f1125,plain,
    ( ~ holdsAt(spinning,plus(n2,n1))
    | ~ happens(push,n2) ),
    inference(resolution,[],[f507,f215]) ).

fof(f1126,plain,
    ~ holdsAt(spinning,plus(n2,n1)),
    inference(forward_subsumption_resolution,[],[f1125,f213]) ).

fof(f1127,plain,
    ~ holdsAt(spinning,plus(n1,n2)),
    inference(forward_demodulation,[],[f1126,f163]) ).

fof(f1128,plain,
    ~ holdsAt(spinning,n3),
    inference(forward_demodulation,[],[f1127,f158]) ).

fof(f1129,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1128,f319]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.18  % Computer : n019.cluster.edu
% 0.12/0.18  % Model    : x86_64 x86_64
% 0.12/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18  % Memory   : 8046.5625MB
% 0.12/0.18  % OS       : Linux 6.8.0-71-generic
% 0.12/0.18  % CPULimit : 300
% 0.12/0.18  % WCLimit  : 300
% 0.12/0.18  % DateTime : Mon Sep 28 22:06:03 UTC 2026
% 0.12/0.19  % CPUTime  : 
% 0.12/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.22  Running first-order model finding
% 0.12/0.22  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.37/0.30  % (327468)Will run a generic schedule for satisfiability detection.
% 0.37/0.30  % (327473)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3517697069_2999 on theBenchmark for (2999ds/0Mi)
% 0.37/0.30  % (327474)% WARNING: option uhcvi not known.
% 0.37/0.30  % (327478)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=811137133:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.30  % (327475)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=888829988:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.37/0.30  % (327476)dis+10_1_sil=32000:sp=arity:random_seed=1954543060:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.37/0.30  % (327477)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=507367226:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.37/0.30  % (327479)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=129609028:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.37/0.30  % (327474)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2410659340:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.37/0.30  % Detected minimum model sizes of [3]
% 0.37/0.30  % Detected maximum model sizes of [max]
% 0.37/0.30  % TRYING [3]
% 0.37/0.30  % TRYING [4]
% 0.37/0.30  % TRYING [5]
% 0.37/0.30  % TRYING [6]
% 0.37/0.30  % (327474) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-327468-327474"...
% 0.37/0.30  % (327474)...printing done.
% 0.37/0.30  % (327474)Refutation found. Thanks to Tanya!
% 0.37/0.30  % SZS status Theorem for theBenchmark
% 0.37/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.30  % (327474)------------------------------
% 0.37/0.30  % (327474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.30  % (327474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.30  % (327474)CaDiCaL version: 2.1.3
% 0.37/0.30  % (327474)Termination reason: Refutation
% 0.37/0.30  % (327474)Time elapsed: 0.028 s
% 0.37/0.30  % (327474)Peak memory usage: 12 MB
% 0.37/0.30  % (327474)Instructions burned: 29 (million)
% 0.37/0.30  % (327468)Success in time 0.076 s
% 0.37/0.30  % Vampire exiting
%------------------------------------------------------------------------------