↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL296-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.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 11:51:54 AM UTC 2026

% Result   : Unsatisfiable 3.58s 1.49s
% Output   : Refutation 3.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   30 (  23 unt;   0 def)
%            Number of atoms       :   39 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (  48   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ~ theorem(not(or(not(or(not(or(not(p),not(q))),or(not(p),not(q)))),not(or(not(or(not(p),not(q))),or(not(p),not(q))))))),
    inference(definition_unfolding,[],[f11,f12,f6]) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f16,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f17,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f18,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f20,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f17,f7]) ).

fof(f21,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f18,f7]) ).

fof(f22,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f16,f7]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f19,f21]) ).

fof(f26,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f15,f7]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f22,f19]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f26,f19]) ).

fof(f32,plain,
    ! [X0] : theorem(or(X0,not(or(X0,X0)))),
    inference(resolution,[],[f29,f21]) ).

fof(f48,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f30,f20]) ).

fof(f59,plain,
    ! [X0] :
      ( theorem(not(or(not(X0),not(X0))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f32,f19]) ).

fof(f63,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f48,f24]) ).

fof(f113,plain,
    ~ theorem(or(not(or(not(p),not(q))),or(not(p),not(q)))),
    inference(resolution,[],[f59,f13]) ).

fof(f115,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f113,f63]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL296-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n001.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 15:39:16 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.58/1.49  % (3726722)Input is clausal, will run a generic CNF schedule.
% 3.58/1.49  % (3726732)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2193556484:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.58/1.49  % (3726730)lrs+10_1_sil=8000:sp=occurrence:random_seed=3667367379:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.58/1.49  % (3726728)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3968625260:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.58/1.49  % (3726729)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1164405700:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.58/1.49  % (3726727)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=2224719251:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.58/1.49  % (3726730)First to succeed.
% 3.58/1.49  % (3726730)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3726722"
% 3.58/1.49  % (3726733)dis-21_1_sil=8000:lcm=predicate:random_seed=1356261843:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.58/1.49  % (3726732)Instruction limit reached! 
% 3.58/1.49  % (3726732)------------------------------
% 3.58/1.49  % (3726732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.49  % (3726732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.49  % (3726732)CaDiCaL version: 2.1.3
% 3.58/1.49  % (3726732)Termination reason: Instruction limit
% 3.58/1.49  % (3726732)Termination phase: Saturation
% 3.58/1.49  % (3726732)Time elapsed: 0.063 s
% 3.58/1.49  % (3726732)Peak memory usage: 89 MB
% 3.58/1.49  % (3726732)Instructions burned: 184 (million)
% 3.58/1.49  % (3726731)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2242994935:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.58/1.49  % (3726731)Also succeeded, but the first one will report.
% 3.58/1.49  % (3726733)Instruction limit reached! 
% 3.58/1.49  % (3726733)------------------------------
% 3.58/1.49  % (3726733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.49  % (3726733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.49  % (3726733)CaDiCaL version: 2.1.3
% 3.58/1.49  % (3726733)Termination reason: Instruction limit
% 3.58/1.49  % (3726733)Termination phase: Saturation
% 3.58/1.49  % (3726733)Time elapsed: 0.057 s
% 3.58/1.49  % (3726733)Peak memory usage: 88 MB
% 3.58/1.49  % (3726733)Instructions burned: 119 (million)
% 3.58/1.49  % (3726741)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1031282742:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.58/1.49  % (3726741)Refutation not found, incomplete strategy
% 3.58/1.49  % (3726741)------------------------------
% 3.58/1.49  % (3726741)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.49  % (3726741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.49  % (3726741)CaDiCaL version: 2.1.3
% 3.58/1.49  % (3726741)Termination reason: Refutation not found, incomplete strategy
% 3.58/1.49  % (3726741)Time elapsed: 0.001 s
% 3.58/1.49  % (3726741)Peak memory usage: 88 MB
% 3.58/1.49  % (3726742)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1427817729:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.58/1.49  % (3726742)Refutation not found, incomplete strategy
% 3.58/1.49  % (3726742)------------------------------
% 3.58/1.49  % (3726742)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.49  % (3726742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.49  % (3726742)CaDiCaL version: 2.1.3
% 3.58/1.49  % (3726742)Termination reason: Refutation not found, incomplete strategy
% 3.58/1.49  % (3726742)Time elapsed: 0.001 s
% 3.58/1.49  % (3726742)Peak memory usage: 87 MB
% 3.58/1.49  % (3726730)Refutation found. Thanks to Tanya!
% 3.58/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.58/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.49  % (3726730)------------------------------
% 3.58/1.49  % (3726730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.49  % (3726730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.49  % (3726730)CaDiCaL version: 2.1.3
% 3.58/1.49  % (3726730)Termination reason: Refutation
% 3.58/1.49  % (3726730)Time elapsed: 0.004 s
% 3.58/1.49  % (3726730)Peak memory usage: 88 MB
% 3.58/1.49  % (3726730)Instructions burned: 3 (million)
% 3.58/1.49  % (3726730)------------------------------
% 3.58/1.49  % (3726730)------------------------------
% 3.58/1.49  % (3726722)Success in time 0.435 s
% 3.58/1.49  % Vampire exiting
%------------------------------------------------------------------------------