↑ Up

Vampire---5.0.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : PUZ054-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 : n007.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 12:31:23 PM UTC 2026

% Result   : Satisfiable 5.28s 1.74s
% Output   : Saturation 5.28s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u385,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(n0))),true,true,true) ).

cnf(u58,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(n0))))))) ).

cnf(u367,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(n0))))),true,true,true) ).

cnf(u395,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(n0)),true,true,true) ).

cnf(u191,axiom,
    true = p(n0,s(s(s(s(n0))))) ).

cnf(u219,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(n0))))))) ).

cnf(u396,axiom,
    true = p(s(s(n0)),s(n0)) ).

cnf(u406,axiom,
    true = p(s(s(n0)),n0) ).

cnf(u631,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(n0)))) ).

cnf(u171,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u215,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(n0))))),true,true,true) ).

cnf(u139,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) ).

cnf(u217,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(n0))))) ).

cnf(u27,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(n0)))))))) ).

cnf(u45,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))),true,true,true) ).

cnf(u449,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(n0)))))),true,true,true) ).

cnf(u166,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(n0)))))))))) ).

cnf(u459,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(n0))))) ).

cnf(u477,axiom,
    true = p(s(s(s(s(n0)))),s(s(n0))) ).

cnf(u350,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(n0))))))) ).

cnf(u299,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(s(n0)))))))))) ).

cnf(u340,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(s(s(s(n0)))))))),true,true,true) ).

cnf(u123,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))),true,true,true) ).

cnf(u555,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(n0))),true,true,true) ).

cnf(u358,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(s(n0)))))),true,true,true) ).

cnf(u174,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(n0)))))))),true,true,true) ).

cnf(u458,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(s(s(n0))))),true,true,true) ).

cnf(u176,axiom,
    true = p(n0,s(s(s(s(s(s(s(n0)))))))) ).

cnf(u440,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(n0))))))),true,true,true) ).

cnf(u186,axiom,
    true = p(n0,s(s(s(s(s(n0)))))) ).

cnf(u181,axiom,
    true = p(n0,s(s(s(s(s(s(n0))))))) ).

cnf(u60,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u161,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(s(n0))))))))))) ).

cnf(u419,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u265,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(n0))))))))))) ).

cnf(u189,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(n0))))),true,true,true) ).

cnf(u194,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(n0)))),true,true,true) ).

cnf(u546,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(n0)))) ).

cnf(u127,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))))) ).

cnf(u199,axiom,
    true = ifeq(p(s(s(n0)),s(s(n0))),true,true,true) ).

cnf(u376,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(n0)))),true,true,true) ).

cnf(u6,axiom,
    true = ifeq(p(X0,s(s(X1))),true,p(X0,s(X1)),true) ).

cnf(u29,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(s(n0)))))))))) ).

cnf(u229,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) ).

cnf(u39,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) ).

cnf(u341,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(n0)))))))) ).

cnf(u196,axiom,
    true = p(n0,s(s(s(n0)))) ).

cnf(u241,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u8,axiom,
    true = ifeq(p(s(X0),s(X1)),true,p(s(X0),X1),true) ).

cnf(u18,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(s(s(n0))))))))))) ).

cnf(u580,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),n0) ).

cnf(u598,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(n0)) ).

cnf(u130,axiom,
    true = ifeq(p(n0,s(s(s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))))),true,true,true) ).

cnf(u533,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(n0)))))) ).

cnf(u4,axiom,
    true = ifeq(p(s(s(X0)),X1),true,p(X0,s(X1)),true) ).

cnf(u494,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),n0),true,true,true) ).

cnf(u49,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) ).

cnf(u204,axiom,
    true = ifeq(p(s(s(n0)),s(n0)),true,true,true) ).

cnf(u496,axiom,
    true = p(s(s(s(s(n0)))),n0) ).

cnf(u103,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(n0)))))) ).

cnf(u16,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(s(s(n0))))))))),true,true,true) ).

cnf(u105,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(n0)))))))) ).

cnf(u159,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(n0))))))))))),true,true,true) ).

cnf(u509,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(n0))))))) ).

cnf(u201,axiom,
    true = p(n0,s(s(n0))) ).

cnf(u82,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))) ).

cnf(u15,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(s(n0))))))))))),true,true,true) ).

cnf(u56,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(n0))))))),true,true,true) ).

cnf(u557,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(n0))) ).

cnf(u17,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u377,axiom,
    true = p(s(s(n0)),s(s(s(n0)))) ).

cnf(u568,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(n0)) ).

cnf(u277,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(n0)))))))))) ).

cnf(u386,axiom,
    true = p(s(s(n0)),s(s(n0))) ).

cnf(u404,axiom,
    true = ifeq(p(s(s(s(s(n0)))),n0),true,true,true) ).

cnf(u78,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))),true,true,true) ).

cnf(u606,axiom,
    true = p(s(s(s(s(s(s(n0)))))),n0) ).

cnf(u169,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(s(n0))))))))),true,true,true) ).

cnf(u521,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(n0))))) ).

cnf(u431,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(n0)))))))) ).

cnf(u179,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(n0))))))),true,true,true) ).

cnf(u25,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(s(s(n0)))))))),true,true,true) ).

cnf(u579,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(n0))) ).

cnf(u35,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),true,true,true) ).

cnf(u164,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(s(s(n0)))))))))),true,true,true) ).

cnf(u81,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) ).

cnf(initial_state,axiom,
    p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(s(s(s(s(s(s(n0)))))))))) = true ).

cnf(u101,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(s(s(n0)))))),true,true,true) ).

cnf(u467,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(s(n0)))),true,true,true) ).

cnf(u441,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(n0))))))) ).

cnf(u312,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(n0)))))))) ).

cnf(u368,axiom,
    true = p(s(s(n0)),s(s(s(s(n0))))) ).

cnf(u576,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),n0),true,true,true) ).

cnf(u566,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(n0)),true,true,true) ).

cnf(u594,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),n0) ).

cnf(u450,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(n0)))))) ).

cnf(u468,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(n0)))) ).

cnf(u142,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),true,true,true) ).

cnf(u10,negated_conjecture,
    true != p(s(n0),n0) ).

cnf(u650,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(n0))))) ).

cnf(u144,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))) ).

cnf(u126,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(s(s(s(s(n0))))))))))))) ).

cnf(u290,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(s(s(s(s(n0)))))) ).

cnf(u485,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(n0)),true,true,true) ).

cnf(u133,axiom,
    true = p(n0,s(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))))) ).

cnf(u286,axiom,
    true = ifeq(p(s(s(s(s(s(s(s(s(s(s(s(s(n0)))))))))))),s(s(s(n0)))),true,true,true) ).

cnf(u184,axiom,
    true = ifeq(p(s(s(n0)),s(s(s(s(s(n0)))))),true,true,true) ).

cnf(u331,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(n0))))))))),true,true,true) ).

cnf(u584,axiom,
    true = p(s(s(s(s(s(s(s(s(n0)))))))),s(n0)) ).

cnf(u349,axiom,
    true = ifeq(p(s(s(s(s(n0)))),s(s(s(s(s(s(n0))))))),true,true,true) ).

cnf(ifeq_axiom,axiom,
    ifeq(X0,X0,X1,X2) = X1 ).

cnf(u359,axiom,
    true = p(s(s(n0)),s(s(s(s(s(n0)))))) ).

cnf(u476,axiom,
    true = ifeq(p(s(s(s(s(s(s(n0)))))),s(s(n0))),true,true,true) ).

cnf(u486,axiom,
    true = p(s(s(s(s(n0)))),s(n0)) ).

cnf(u288,axiom,
    true = p(s(s(s(s(s(s(s(s(s(s(n0)))))))))),s(s(s(n0)))) ).

cnf(u332,axiom,
    true = p(s(s(n0)),s(s(s(s(s(s(s(s(n0))))))))) ).

cnf(u593,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(n0))) ).

cnf(u206,axiom,
    true = p(n0,s(n0)) ).

cnf(u208,axiom,
    true = ifeq(p(s(s(n0)),n0),true,true,true) ).

cnf(u153,axiom,
    true = p(s(s(s(s(n0)))),s(s(s(s(s(s(s(s(s(s(n0))))))))))) ).

cnf(u48,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(s(n0))))))))))) ).

cnf(u92,axiom,
    true = p(s(s(s(s(s(s(n0)))))),s(s(s(s(s(s(s(s(s(n0)))))))))) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ054-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.40  % Computer : n007.cluster.edu
% 0.11/0.40  % Model    : x86_64 x86_64
% 0.11/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40  % Memory   : 8046.5625MB
% 0.11/0.40  % OS       : Linux 6.8.0-71-generic
% 0.11/0.40  % CPULimit : 300
% 0.11/0.40  % WCLimit  : 300
% 0.11/0.40  % DateTime : Sun Sep 27 22:34:56 UTC 2026
% 0.11/0.41  % CPUTime  : 
% 0.11/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44  Running first-order theorem proving
% 0.11/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
% 4.04/1.54  % (1840427)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.04/1.54  % (1840433)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=2840040857:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.04/1.54  % (1840438)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=41394588:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.04/1.54  % (1840434)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3021872408:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.04/1.54  % (1840432)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=748056550:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.04/1.54  % (1840436)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4155315714:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.04/1.54  % (1840435)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3268514687:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.04/1.54  % (1840438)Refutation not found, incomplete strategy
% 4.04/1.54  % (1840438)------------------------------
% 4.04/1.54  % (1840438)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.04/1.54  % (1840438)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.04/1.54  % (1840438)CaDiCaL version: 2.1.3
% 4.04/1.54  % (1840438)Termination reason: Refutation not found, incomplete strategy
% 4.04/1.54  % (1840438)Time elapsed: 0.021 s
% 4.04/1.54  % (1840438)Peak memory usage: 87 MB
% 4.04/1.54  % (1840438)Instructions burned: 42 (million)
% 4.04/1.54  % (1840437)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=102860293:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.04/1.55  % (1840435)Refutation not found, incomplete strategy
% 4.04/1.55  % (1840435)------------------------------
% 4.04/1.55  % (1840435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.04/1.55  % (1840435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.04/1.55  % (1840435)CaDiCaL version: 2.1.3
% 4.04/1.55  % (1840435)Termination reason: Refutation not found, incomplete strategy
% 4.04/1.55  % (1840435)Time elapsed: 0.022 s
% 4.04/1.55  % (1840435)Peak memory usage: 88 MB
% 4.04/1.55  % (1840435)Instructions burned: 42 (million)
% 4.04/1.55  % (1840436)Refutation not found, incomplete strategy
% 4.04/1.55  % (1840436)------------------------------
% 4.04/1.55  % (1840436)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.04/1.55  % (1840436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.04/1.55  % (1840436)CaDiCaL version: 2.1.3
% 4.04/1.55  % (1840436)Termination reason: Refutation not found, incomplete strategy
% 4.04/1.55  % (1840436)Time elapsed: 0.034 s
% 4.04/1.55  % (1840436)Peak memory usage: 88 MB
% 4.04/1.55  % (1840436)Instructions burned: 63 (million)
% 4.04/1.55  % (1840437)Refutation not found, incomplete strategy
% 4.04/1.55  % (1840437)------------------------------
% 4.04/1.55  % (1840437)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.04/1.55  % (1840437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.04/1.55  % (1840437)CaDiCaL version: 2.1.3
% 4.04/1.55  % (1840437)Termination reason: Refutation not found, incomplete strategy
% 4.04/1.55  % (1840437)Time elapsed: 0.034 s
% 4.04/1.55  % (1840437)Peak memory usage: 88 MB
% 4.04/1.55  % (1840437)Instructions burned: 56 (million)
% 4.04/1.55  % (1840438)------------------------------
% 4.04/1.55  % (1840438)------------------------------
% 4.04/1.55  % (1840435)------------------------------
% 4.04/1.55  % (1840435)------------------------------
% 4.04/1.55  % (1840436)------------------------------
% 4.04/1.55  % (1840436)------------------------------
% 4.04/1.55  % (1840437)------------------------------
% 4.04/1.55  % (1840437)------------------------------
% 4.04/1.55  % (1840433)First to succeed.
% 4.04/1.55  % (1840433)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1840427"
% 4.04/1.55  % (1840446)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=4171577914:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 5.28/1.74  % (1840447)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3029820228:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 5.28/1.74  % (1840448)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1014393618:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 5.28/1.74  % (1840449)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=80966346:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2995 on theBenchmark for (2995ds/317Mi)
% 5.28/1.74  % (1840449)Also succeeded, but the first one will report.
% 5.28/1.74  % SZS status Satisfiable for theBenchmark
% 5.28/1.74  % SZS output start Saturation.
% See solution above
% 5.28/1.74  % SZS output start Definitions and Model Updates.
% 5.28/1.74  % SZS output end Definitions and Model Updates.
% 5.28/1.74  % (1840433)------------------------------
% 5.28/1.74  % (1840433)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.28/1.74  % (1840433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.28/1.74  % (1840433)CaDiCaL version: 2.1.3
% 5.28/1.74  % (1840433)Termination reason: Satisfiable
% 5.28/1.74  % (1840433)Time elapsed: 0.399 s
% 5.28/1.74  % (1840433)Peak memory usage: 129 MB
% 5.28/1.74  % (1840433)Instructions burned: 1029 (million)
% 5.28/1.74  % (1840433)------------------------------
% 5.28/1.74  % (1840433)------------------------------
% 5.28/1.74  % (1840427)Success in time 0.66 s
% 5.28/1.74  % Vampire exiting
%------------------------------------------------------------------------------