↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n018.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:43 AM UTC 2026

% Result   : Unsatisfiable 4.76s 1.42s
% Output   : Refutation 4.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   48 (  48 unt;   0 def)
%            Number of atoms       :   48 (  47 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-4 aty)
%            Number of variables   :   82 (  82   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

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

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

fof(f4,plain,
    ! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
    inference(reorient_equations,[],[f3]) ).

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

fof(f6,plain,
    ! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
    inference(reorient_equations,[],[f5]) ).

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

fof(f10,plain,
    ! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(reorient_equations,[],[f9]) ).

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

fof(f12,axiom,
    ! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f13,plain,
    ! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
    inference(reorient_equations,[],[f12]) ).

fof(f14,axiom,
    ! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f15,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
    inference(reorient_equations,[],[f14]) ).

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

fof(f17,negated_conjecture,
    theorem(not(and(p,not(p)))) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f18,plain,
    true != theorem(not(and(p,not(p)))),
    inference(reorient_equations,[],[f17]) ).

fof(f21,plain,
    ! [X0] : true = ifeq(true,true,theorem(implies(or(X0,X0),X0)),true),
    inference(superposition,[],[f13,f2]) ).

fof(f22,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(implies(X0,or(X1,X0))),true),
    inference(superposition,[],[f13,f4]) ).

fof(f25,plain,
    ! [X0,X1] : true = theorem(implies(X0,or(X1,X0))),
    inference(forward_demodulation,[],[f22,f1]) ).

fof(f26,plain,
    ! [X0] : true = theorem(implies(or(X0,X0),X0)),
    inference(forward_demodulation,[],[f21,f1]) ).

fof(f35,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true),
    inference(superposition,[],[f13,f6]) ).

fof(f36,plain,
    ! [X0,X1] : true = theorem(implies(or(X0,X1),or(X1,X0))),
    inference(forward_demodulation,[],[f35,f1]) ).

fof(f39,plain,
    ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
    inference(forward_demodulation,[],[f16,f11]) ).

fof(f45,plain,
    ! [X0,X1] : true = theorem(implies(implies(X0,X1),or(X1,not(X0)))),
    inference(superposition,[],[f36,f11]) ).

fof(f80,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),true),
    inference(superposition,[],[f13,f10]) ).

fof(f81,plain,
    ! [X2,X0,X1] : true = theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(forward_demodulation,[],[f80,f1]) ).

fof(f134,plain,
    ! [X0,X1] : true = ifeq(true,true,ifeq(theorem(implies(X0,X1)),true,theorem(or(X1,not(X0))),true),true),
    inference(superposition,[],[f15,f45]) ).

fof(f135,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true),
    inference(superposition,[],[f15,f25]) ).

fof(f137,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(implies(or(X0,X0),X0),X1)),true,ifeq(true,true,theorem(X1),true),true),
    inference(superposition,[],[f15,f26]) ).

fof(f160,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(implies(or(X0,X0),X0),X1)),true,theorem(X1),true),
    inference(forward_demodulation,[],[f137,f1]) ).

fof(f162,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,theorem(X2),true),
    inference(forward_demodulation,[],[f135,f1]) ).

fof(f163,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,theorem(or(X1,not(X0))),true),
    inference(forward_demodulation,[],[f134,f1]) ).

fof(f720,plain,
    ! [X2,X0,X1] : true = theorem(implies(implies(X2,X1),implies(or(not(X0),X2),implies(X0,X1)))),
    inference(superposition,[],[f81,f11]) ).

fof(f737,plain,
    ! [X2,X0,X1] : true = theorem(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1)))),
    inference(forward_demodulation,[],[f720,f11]) ).

fof(f2932,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(implies(implies(X1,or(X0,X0)),implies(X1,X0))),true),
    inference(superposition,[],[f160,f737]) ).

fof(f3105,plain,
    ! [X0,X1] : true = theorem(implies(implies(X1,or(X0,X0)),implies(X1,X0))),
    inference(forward_demodulation,[],[f2932,f1]) ).

fof(f3213,plain,
    ! [X0] : true = ifeq(true,true,theorem(implies(X0,X0)),true),
    inference(superposition,[],[f162,f3105]) ).

fof(f3394,plain,
    ! [X0] : true = theorem(implies(X0,X0)),
    inference(forward_demodulation,[],[f3213,f1]) ).

fof(f3398,plain,
    ! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
    inference(superposition,[],[f163,f3394]) ).

fof(f3421,plain,
    ! [X0] : true = theorem(or(X0,not(X0))),
    inference(forward_demodulation,[],[f3398,f1]) ).

fof(f3424,plain,
    ! [X0] : true = theorem(implies(X0,not(not(X0)))),
    inference(superposition,[],[f3421,f11]) ).

fof(f3555,plain,
    ! [X0] : true = ifeq(true,true,ifeq(theorem(X0),true,theorem(not(not(X0))),true),true),
    inference(superposition,[],[f15,f3424]) ).

fof(f3575,plain,
    ! [X0] : true = ifeq(theorem(X0),true,theorem(not(not(X0))),true),
    inference(forward_demodulation,[],[f3555,f1]) ).

fof(f6077,plain,
    ! [X0] : true = ifeq(true,true,theorem(not(not(implies(X0,not(not(X0)))))),true),
    inference(superposition,[],[f3575,f3424]) ).

fof(f6123,plain,
    ! [X0] : true = theorem(not(not(implies(X0,not(not(X0)))))),
    inference(forward_demodulation,[],[f6077,f1]) ).

fof(f6268,plain,
    ! [X0] : true = theorem(not(and(X0,not(X0)))),
    inference(forward_demodulation,[],[f6123,f39]) ).

fof(f6299,plain,
    true != true,
    inference(superposition,[],[f18,f6268]) ).

fof(f6315,plain,
    $false,
    inference(trivial_inequality_removal,[],[f6299]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n018.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 15:30:53 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/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
% 4.76/1.42  % (2517358)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.76/1.42  % (2517364)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3809098801:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.76/1.42  % (2517369)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3310329641:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.76/1.42  % (2517366)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2521879045:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.76/1.42  % (2517363)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=3262720885:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.76/1.42  % (2517367)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=553237677:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.76/1.42  % (2517368)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1936173160:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.76/1.42  % (2517365)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1788858587:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.76/1.42  % (2517366)Instruction limit reached! 
% 4.76/1.42  % (2517366)------------------------------
% 4.76/1.42  % (2517366)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.42  % (2517366)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.42  % (2517366)CaDiCaL version: 2.1.3
% 4.76/1.42  % (2517366)Termination reason: Instruction limit
% 4.76/1.42  % (2517366)Termination phase: Saturation
% 4.76/1.42  % (2517366)Time elapsed: 0.084 s
% 4.76/1.42  % (2517366)Peak memory usage: 89 MB
% 4.76/1.42  % (2517366)Instructions burned: 137 (million)
% 4.76/1.42  % (2517368)Instruction limit reached! 
% 4.76/1.42  % (2517368)------------------------------
% 4.76/1.42  % (2517368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.42  % (2517368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.42  % (2517368)CaDiCaL version: 2.1.3
% 4.76/1.42  % (2517368)Termination reason: Instruction limit
% 4.76/1.42  % (2517368)Termination phase: Saturation
% 4.76/1.42  % (2517368)Time elapsed: 0.095 s
% 4.76/1.42  % (2517368)Peak memory usage: 90 MB
% 4.76/1.42  % (2517368)Instructions burned: 260 (million)
% 4.76/1.42  % (2517367)Instruction limit reached! 
% 4.76/1.42  % (2517367)------------------------------
% 4.76/1.42  % (2517367)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.42  % (2517367)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.42  % (2517367)CaDiCaL version: 2.1.3
% 4.76/1.42  % (2517367)Termination reason: Instruction limit
% 4.76/1.42  % (2517367)Termination phase: Saturation
% 4.76/1.42  % (2517367)Time elapsed: 0.103 s
% 4.76/1.42  % (2517367)Peak memory usage: 89 MB
% 4.76/1.42  % (2517367)Instructions burned: 182 (million)
% 4.76/1.42  % (2517369)First to succeed.
% 4.76/1.42  % (2517369)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2517358"
% 4.76/1.42  % (2517378)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2091817341:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 4.76/1.42  % (2517377)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3441132773:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 4.76/1.42  % (2517379)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1875307550:i=215:ep=RSTC_2997 on theBenchmark for (2997ds/215Mi)
% 4.76/1.42  % (2517379)Instruction limit reached! 
% 4.76/1.42  % (2517379)------------------------------
% 4.76/1.42  % (2517379)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.42  % (2517379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.42  % (2517379)CaDiCaL version: 2.1.3
% 4.76/1.42  % (2517379)Termination reason: Instruction limit
% 4.76/1.42  % (2517379)Termination phase: Saturation
% 4.76/1.42  % (2517379)Time elapsed: 0.108 s
% 4.76/1.42  % (2517379)Peak memory usage: 88 MB
% 4.76/1.42  % (2517379)Instructions burned: 216 (million)
% 4.76/1.42  % (2517369)Refutation found. Thanks to Tanya!
% 4.76/1.42  % SZS status Unsatisfiable for theBenchmark
% 4.76/1.42  % SZS output start Proof for theBenchmark
% See solution above
% 4.76/1.42  % (2517369)------------------------------
% 4.76/1.42  % (2517369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.42  % (2517369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.42  % (2517369)CaDiCaL version: 2.1.3
% 4.76/1.42  % (2517369)Termination reason: Refutation
% 4.76/1.42  % (2517369)Time elapsed: 0.196 s
% 4.76/1.42  % (2517369)Peak memory usage: 92 MB
% 4.76/1.42  % (2517369)Instructions burned: 335 (million)
% 4.76/1.42  % (2517369)------------------------------
% 4.76/1.42  % (2517369)------------------------------
% 4.76/1.42  % (2517358)Success in time 0.614 s
% 4.76/1.42  % Vampire exiting
%------------------------------------------------------------------------------