↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n009.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:13 AM UTC 2026

% Result   : Unsatisfiable 2.69s 1.43s
% Output   : Refutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  19 unt;   0 def)
%            Number of atoms       :   41 (  18 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   26 (  15   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   38 (  38   !;   0   ?)

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

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

fof(f7,axiom,
    ! [X0,X1] : big_V(X0,X1) = implies(implies(X0,X1),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',big_V_definition) ).

fof(f8,plain,
    ! [X0,X1] : implies(implies(X0,X1),X1) = big_V(X0,X1),
    inference(reorient_equations,[],[f7]) ).

fof(f10,axiom,
    ! [X0,X1] :
      ( ~ ordered(X0,X1)
      | implies(X0,X1) = truth ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partial_order_definition1) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ ordered(X0,X1)
      | truth = implies(X0,X1) ),
    inference(reorient_equations,[],[f10]) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( implies(X0,X1) != truth
      | ordered(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partial_order_definition2) ).

fof(f13,plain,
    ! [X0,X1] :
      ( truth != implies(X0,X1)
      | ordered(X0,X1) ),
    inference(reorient_equations,[],[f12]) ).

fof(f14,axiom,
    ! [X2,X0,X1] :
      ( ordered(implies(X0,X2),implies(X1,X2))
      | ~ ordered(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1) ).

fof(f16,axiom,
    ! [X2,X0,X1] :
      ( ~ ordered(X0,implies(X1,X2))
      | ordered(X1,implies(X0,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_1) ).

fof(f23,negated_conjecture,
    big_V(implies(x,y),implies(y,x)) != truth,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_4) ).

fof(f24,plain,
    truth != big_V(implies(x,y),implies(y,x)),
    inference(reorient_equations,[],[f23]) ).

fof(f26,plain,
    truth != implies(implies(implies(x,y),implies(y,x)),implies(y,x)),
    inference(definition_unfolding,[],[f24,f8]) ).

fof(f31,plain,
    ! [X0] :
      ( truth != X0
      | ordered(truth,X0) ),
    inference(superposition,[],[f13,f1]) ).

fof(f32,plain,
    ordered(truth,truth),
    inference(equality_resolution,[],[f31]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ordered(X0,implies(X1,X0))
      | ~ ordered(truth,X1) ),
    inference(superposition,[],[f14,f1]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ordered(implies(X1,X0),X0)
      | ~ ordered(X1,truth) ),
    inference(superposition,[],[f14,f1]) ).

fof(f43,plain,
    ! [X0] :
      ( ordered(X0,X0)
      | ~ ordered(truth,truth) ),
    inference(superposition,[],[f34,f1]) ).

fof(f44,plain,
    ! [X0] : ordered(X0,X0),
    inference(forward_subsumption_resolution,[],[f43,f32]) ).

fof(f49,plain,
    ! [X0] : truth = implies(X0,X0),
    inference(resolution,[],[f44,f11]) ).

fof(f50,plain,
    ! [X0,X1] : ordered(X0,implies(implies(X0,X1),X1)),
    inference(resolution,[],[f44,f16]) ).

fof(f52,plain,
    ! [X0] : implies(X0,X0) = implies(implies(X0,truth),truth),
    inference(superposition,[],[f4,f1]) ).

fof(f67,plain,
    ! [X0] : truth = implies(implies(X0,truth),truth),
    inference(forward_demodulation,[],[f52,f49]) ).

fof(f227,plain,
    ! [X0] : ordered(X0,truth),
    inference(superposition,[],[f50,f67]) ).

fof(f401,plain,
    ! [X0] :
      ( ordered(truth,X0)
      | ~ ordered(X0,truth) ),
    inference(superposition,[],[f35,f49]) ).

fof(f403,plain,
    ! [X0] : ordered(truth,X0),
    inference(forward_subsumption_resolution,[],[f401,f227]) ).

fof(f411,plain,
    ! [X0] : truth = implies(truth,X0),
    inference(resolution,[],[f403,f11]) ).

fof(f554,plain,
    ! [X0] : truth = X0,
    inference(superposition,[],[f1,f411]) ).

fof(f692,plain,
    truth != truth,
    inference(superposition,[],[f26,f554]) ).

fof(f732,plain,
    $false,
    inference(trivial_inequality_removal,[],[f692]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL109-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  % Computer : n009.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 15:22:15 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44  Running first-order theorem proving
% 0.13/0.44  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
% 2.69/1.43  % (2163753)Input is clausal, will run a generic CNF schedule.
% 2.69/1.43  % (2163769)lrs+10_1_sil=8000:sp=occurrence:random_seed=4272253138:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.69/1.43  % (2163769)First to succeed.
% 2.69/1.43  % (2163769)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2163753"
% 2.69/1.43  % (2163772)dis-21_1_sil=8000:lcm=predicate:random_seed=1200559688: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)
% 2.69/1.43  % (2163767)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1105807767:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.69/1.43  % (2163768)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=985535097:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.69/1.43  % (2163766)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=338066959:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.69/1.43  % (2163772)Refutation not found, incomplete strategy
% 2.69/1.43  % (2163772)------------------------------
% 2.69/1.43  % (2163772)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.43  % (2163772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.43  % (2163772)CaDiCaL version: 2.1.3
% 2.69/1.43  % (2163772)Termination reason: Refutation not found, incomplete strategy
% 2.69/1.43  % (2163772)Time elapsed: 0.002 s
% 2.69/1.43  % (2163772)Peak memory usage: 88 MB
% 2.69/1.43  % (2163772)Instructions burned: 1 (million)
% 2.69/1.43  % (2163771)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=766645162:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.69/1.43  % (2163770)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3661830565:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.69/1.43  % (2163771)Also succeeded, but the first one will report.
% 2.69/1.43  % (2163770)Instruction limit reached! 
% 2.69/1.43  % (2163770)------------------------------
% 2.69/1.43  % (2163770)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.43  % (2163770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.43  % (2163770)CaDiCaL version: 2.1.3
% 2.69/1.43  % (2163770)Termination reason: Instruction limit
% 2.69/1.43  % (2163770)Termination phase: Saturation
% 2.69/1.43  % (2163770)Time elapsed: 0.073 s
% 2.69/1.43  % (2163770)Peak memory usage: 89 MB
% 2.69/1.43  % (2163770)Instructions burned: 114 (million)
% 2.69/1.43  % (2163769)Refutation found. Thanks to Tanya!
% 2.69/1.43  % SZS status Unsatisfiable for theBenchmark
% 2.69/1.43  % SZS output start Proof for theBenchmark
% See solution above
% 2.69/1.43  % (2163769)------------------------------
% 2.69/1.43  % (2163769)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.43  % (2163769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.43  % (2163769)CaDiCaL version: 2.1.3
% 2.69/1.43  % (2163769)Termination reason: Refutation
% 2.69/1.43  % (2163769)Time elapsed: 0.010 s
% 2.69/1.43  % (2163769)Peak memory usage: 89 MB
% 2.69/1.43  % (2163769)Instructions burned: 27 (million)
% 2.69/1.43  % (2163769)------------------------------
% 2.69/1.43  % (2163769)------------------------------
% 2.69/1.43  % (2163753)Success in time 0.274 s
% 2.69/1.43  % Vampire exiting
%------------------------------------------------------------------------------