↑ Up

Vampire---5.0.1.SAT-Sat.s

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

% Computer : n017.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 02:01:23 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause3,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv2(X1)
    | ~ ssPv2(X0)
    | ~ ssPv4(X0)
    | ssPv3(X0) ) ).

cnf(u100,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssPv3(X0)
    | ~ ssRr(X1,X0)
    | ~ ssPv1(X1)
    | ssPv2(skf1(X1)) ) ).

cnf(clause13,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ssPv3(X2) ) ).

cnf(u42,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ~ ssPv4(X0)
    | ~ ssPv1(X0)
    | ssPv3(skf1(X0)) ) ).

cnf(clause5,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ssPv4(X1)
    | ssPv2(X2)
    | ssPv2(X0) ) ).

cnf(u94,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ssPv2(X0)
    | ssPv3(skf1(X0))
    | ssPv3(X0) ) ).

cnf(u34,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ssPv4(X1)
    | ssPv2(skf1(X0)) ) ).

cnf(clause7,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X0)
    | ssPv4(X1)
    | ssPv3(X2)
    | ssPv1(X0) ) ).

cnf(u127,negated_conjecture,
    ( ssPv1(skf1(X0))
    | ssPv2(X0)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ~ ssPv3(X0) ) ).

cnf(u89,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ~ ssPv4(X1)
    | ssPv4(skf1(X1))
    | ssPv2(skf1(X1)) ) ).

cnf(u46,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv4(X0)
    | ~ ssRr(X1,X0)
    | ~ ssPv3(X1)
    | ssPv3(X2)
    | ssPv1(skf1(X1)) ) ).

cnf(u38,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ~ ssPv2(X0)
    | ssPv3(skf1(X0))
    | ssPv1(X0) ) ).

cnf(u32,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ssPv4(X1)
    | ssPv3(skf1(X0)) ) ).

cnf(u70,negated_conjecture,
    ( ~ ssPv4(skf1(X0))
    | ssPv2(X0)
    | ssPv3(X0)
    | ssPv1(X0)
    | ssPv4(X0) ) ).

cnf(u79,negated_conjecture,
    ( ~ ssPv2(skf1(X1))
    | ~ ssPv3(X0)
    | ~ ssRr(X1,X0)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ) ).

cnf(u195,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ~ ssPv4(X0)
    | ~ ssPv3(X0)
    | ssPv2(X0)
    | ~ ssPv1(X0) ) ).

cnf(u24,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ssPv3(X1)
    | ssPv2(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0) ) ).

cnf(u125,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ssPv2(skf1(X1))
    | ssPv3(X1)
    | ssPv1(X1)
    | ssPv4(X1) ) ).

cnf(u87,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv2(X0)
    | ~ ssPv4(X0)
    | ssPv3(X0) ) ).

cnf(u26,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ssPv4(X1)
    | ssPv2(skf1(X0))
    | ssPv2(X0) ) ).

cnf(u117,negated_conjecture,
    ( ssPv3(skf1(X0))
    | ~ ssPv3(X0)
    | ssPv1(skf1(X0))
    | ~ ssPv2(X0)
    | ssPv1(X0) ) ).

cnf(u36,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ~ ssPv4(X1)
    | ssPv1(skf1(X1))
    | ssPv2(X1) ) ).

cnf(clause18,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X2)
    | ~ ssPv2(X2)
    | ~ ssRr(X0,X1)
    | ssPv3(X3)
    | ssPv2(X0) ) ).

cnf(u88,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0) ) ).

cnf(u71,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv1(X0)
    | ~ ssPv2(X1)
    | ssPv3(skf1(X1))
    | ssPv2(skf1(X1)) ) ).

cnf(u28,negated_conjecture,
    ( ssPv3(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0)
    | ~ ssPv2(X0)
    | ~ ssPv4(X0) ) ).

cnf(u30,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv2(X0)
    | ssPv4(X1)
    | ssPv3(skf1(X0))
    | ssPv1(X0) ) ).

cnf(u105,negated_conjecture,
    ( ~ ssPv4(skf1(X0))
    | ~ ssPv3(X0)
    | ssPv3(skf1(X0))
    | ssPv1(skf1(X0)) ) ).

cnf(u22,negated_conjecture,
    ( ssPv1(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0)
    | ssPv4(X0) ) ).

cnf(clause16,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv1(X1)
    | ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X0)
    | ssPv3(X2)
    | ssPv2(X3) ) ).

cnf(u99,negated_conjecture,
    ( ssPv3(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0)
    | ssPv2(X0)
    | ssPv4(X0) ) ).

cnf(clause8,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ssPv4(X1)
    | ssPv3(X2) ) ).

cnf(u59,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv4(X0)
    | ~ ssPv1(X2)
    | ~ ssRr(X1,X0)
    | ssPv2(skf1(X1))
    | ssPv1(X1) ) ).

cnf(u171,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ~ ssPv3(X0)
    | ~ ssPv3(X1)
    | ssPv2(X0)
    | ssPv2(skf1(X0)) ) ).

cnf(clause10,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X0)
    | ssPv1(X2)
    | ssPv2(X0) ) ).

cnf(u51,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X0)
    | ~ ssPv1(X2)
    | ~ ssRr(X1,X0)
    | ssPv2(skf1(X1))
    | ssPv3(X1) ) ).

cnf(clause20,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv4(X1)
    | ~ ssRr(X0,X2)
    | ~ ssPv1(X2)
    | ~ ssRr(X0,X1)
    | ssPv2(X3)
    | ssPv1(X0) ) ).

cnf(clause2,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ssPv1(X1)
    | ssPv1(X0)
    | ssPv3(X0)
    | ssPv4(X0) ) ).

cnf(u61,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X0)
    | ~ ssPv1(X2)
    | ~ ssRr(X1,X0)
    | ~ ssPv1(X1)
    | ssPv2(skf1(X1)) ) ).

cnf(u135,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ssPv3(skf1(X1))
    | ssPv2(X1)
    | ~ ssPv4(X1)
    | ssPv3(X1) ) ).

cnf(clause12,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X2)
    | ssPv2(X0)
    | ssPv3(X0) ) ).

cnf(u139,negated_conjecture,
    ( ~ ssPv3(skf1(X0))
    | ~ ssPv4(X0)
    | ssPv4(skf1(X0))
    | ssPv2(skf1(X0)) ) ).

cnf(u95,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssPv4(X0)
    | ~ ssRr(X1,X0)
    | ssPv2(skf1(X1))
    | ssPv1(X1) ) ).

cnf(clause14,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv2(X1)
    | ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ssPv4(X2)
    | ssPv3(X3)
    | ssPv2(X0) ) ).

cnf(u55,negated_conjecture,
    ( ~ ssPv3(skf1(X0))
    | ~ ssPv4(X0)
    | ssPv1(skf1(X0))
    | ssPv2(X0) ) ).

cnf(u133,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ssPv3(skf1(X1))
    | ssPv2(X1)
    | ssPv1(X1)
    | ssPv3(X1) ) ).

cnf(clause6,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ssPv2(X2)
    | ssPv2(X0)
    | ssPv3(X0) ) ).

cnf(u47,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ~ ssPv4(X0)
    | ssPv4(skf1(X0))
    | ~ ssPv1(X0) ) ).

cnf(u41,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ~ ssPv1(X1)
    | ~ ssPv4(X1)
    | ssPv3(skf1(X1)) ) ).

cnf(u182,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ~ ssPv2(X0)
    | ~ ssPv4(X0)
    | ssPv4(skf1(X0))
    | ssPv1(skf1(X0)) ) ).

cnf(u43,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv2(X0)
    | ~ ssRr(X1,X0)
    | ssPv4(X2)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ) ).

cnf(u122,negated_conjecture,
    ( ssPv3(skf1(X0))
    | ~ ssPv3(X0)
    | ssPv2(X0)
    | ~ ssPv1(X0) ) ).

cnf(u35,negated_conjecture,
    ( ~ ssPv4(skf1(X0))
    | ssPv2(skf1(X0))
    | ssPv2(X0)
    | ssPv3(X0) ) ).

cnf(clause4,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ssPv3(X1)
    | ssPv2(X2)
    | ssPv1(X0)
    | ssPv3(X0) ) ).

cnf(u78,negated_conjecture,
    ( ~ ssPv2(skf1(X0))
    | ssPv4(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv2(X0) ) ).

cnf(u45,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ssPv3(skf1(X0))
    | ~ ssPv4(X0)
    | ssPv2(X0)
    | ssPv3(X0) ) ).

cnf(u37,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv1(X0)
    | ~ ssPv3(X1)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ) ).

cnf(u66,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv2(X0)
    | ssPv4(skf1(X1))
    | ssPv3(skf1(X1))
    | ssPv2(X1) ) ).

cnf(u39,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssRr(X1,X0)
    | ~ ssPv4(X0)
    | ssPv2(X1)
    | ssPv3(X1) ) ).

cnf(u118,negated_conjecture,
    ( ssPv3(skf1(X0))
    | ~ ssPv3(X0)
    | ssPv1(skf1(X0))
    | ~ ssPv4(X0)
    | ~ ssPv1(X0) ) ).

cnf(u69,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv4(X0)
    | ~ ssPv3(X1)
    | ssPv3(skf1(X1))
    | ssPv1(skf1(X1)) ) ).

cnf(u31,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ssPv4(skf1(X0))
    | ~ ssPv1(X0)
    | ssPv2(X0) ) ).

cnf(u144,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ~ ssPv4(X0)
    | ssPv3(X0)
    | ~ ssPv2(X0) ) ).

cnf(u25,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv1(X0)
    | ssPv3(X0) ) ).

cnf(u136,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv3(X0)
    | ssPv3(skf1(X1))
    | ssPv2(X1)
    | ssPv3(X1) ) ).

cnf(u104,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv3(X0)
    | ssPv2(X0) ) ).

cnf(u77,negated_conjecture,
    ( ~ ssPv1(skf1(X1))
    | ~ ssPv3(X0)
    | ~ ssRr(X1,X0)
    | ssPv2(skf1(X1))
    | ssPv3(X1) ) ).

cnf(clause17,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X2)
    | ~ ssPv1(X2)
    | ~ ssRr(X0,X1)
    | ssPv2(X3)
    | ssPv3(X0) ) ).

cnf(u156,negated_conjecture,
    ( ssPv2(skf1(X0))
    | ssPv3(X0)
    | ssPv1(X0)
    | ssPv4(X0) ) ).

cnf(u64,negated_conjecture,
    ( ~ ssRr(X0,X1)
    | ~ ssPv4(X1)
    | ssPv2(X0)
    | ssPv3(X0)
    | ssPv1(X0)
    | ssPv4(X0) ) ).

cnf(clause19,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X0)
    | ssPv4(X2)
    | ssPv2(X3) ) ).

cnf(u56,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X0)
    | ~ ssRr(X1,X0)
    | ~ ssPv4(X1)
    | ssPv4(X2)
    | ssPv2(skf1(X1)) ) ).

cnf(u29,negated_conjecture,
    ( ~ ssRr(X1,X0)
    | ~ ssPv4(X0)
    | ssPv2(skf1(X1))
    | ssPv2(X1)
    | ssPv3(X1) ) ).

cnf(clause21,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X2)
    | ~ ssPv1(X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ssPv2(X3) ) ).

cnf(u110,negated_conjecture,
    ( ~ ssPv1(skf1(X0))
    | ~ ssPv2(X0)
    | ssPv3(skf1(X0))
    | ssPv2(skf1(X0)) ) ).

cnf(u50,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ~ ssPv4(X0)
    | ~ ssPv1(X0)
    | ~ ssPv2(X0)
    | ssPv3(X0) ) ).

cnf(u23,negated_conjecture,
    ( ~ ssPv2(skf1(X0))
    | ~ ssPv2(X0)
    | ~ ssPv4(X0)
    | ssPv3(X0) ) ).

cnf(u60,negated_conjecture,
    ( ~ ssPv1(skf1(X0))
    | ~ ssPv3(X0)
    | ssPv3(skf1(X0))
    | ssPv2(X0) ) ).

cnf(clause15,negated_conjecture,
    ( ~ ssRr(X0,X3)
    | ~ ssPv4(X1)
    | ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X0)
    | ssPv3(X2)
    | ssPv1(X3) ) ).

cnf(clause9,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X0)
    | ~ ssPv4(X0)
    | ssPv4(X1)
    | ssPv2(X2) ) ).

cnf(u85,negated_conjecture,
    ( ssPv4(skf1(X0))
    | ssPv3(skf1(X0))
    | ssPv2(X0)
    | ~ ssPv1(X0) ) ).

cnf(u54,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv3(X0)
    | ~ ssPv2(X2)
    | ~ ssRr(X1,X0)
    | ssPv3(skf1(X1))
    | ssPv2(X1) ) ).

cnf(clause11,negated_conjecture,
    ( ~ ssRr(X0,X2)
    | ~ ssPv1(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X0)
    | ssPv3(X2)
    | ssPv2(X0) ) ).

cnf(clause1,negated_conjecture,
    ssRr(X0,skf1(X0)) ).

cnf(u48,negated_conjecture,
    ( ~ ssRr(X1,X2)
    | ~ ssPv1(X0)
    | ~ ssRr(X1,X0)
    | ~ ssPv2(X1)
    | ssPv3(X2)
    | ssPv2(skf1(X1)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN735-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.20  % Computer : n017.cluster.edu
% 0.12/0.20  % Model    : x86_64 x86_64
% 0.12/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.20  % Memory   : 8046.5625MB
% 0.12/0.20  % OS       : Linux 6.8.0-71-generic
% 0.12/0.20  % CPULimit : 300
% 0.12/0.20  % WCLimit  : 300
% 0.12/0.20  % DateTime : Mon Sep 28 16:45:51 UTC 2026
% 0.12/0.20  % CPUTime  : 
% 0.12/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.23  Running first-order theorem proving
% 0.12/0.23  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.93/1.25  % (3702722)Input is clausal, will run a generic CNF schedule.
% 3.93/1.25  % (3702836)dis-21_1_sil=8000:lcm=predicate:random_seed=1872776467: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.93/1.25  % (3702836)Instruction limit reached! 
% 3.93/1.25  % (3702836)------------------------------
% 3.93/1.25  % (3702836)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.25  % (3702836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.25  % (3702836)CaDiCaL version: 2.1.3
% 3.93/1.25  % (3702836)Termination reason: Instruction limit
% 3.93/1.25  % (3702836)Termination phase: Saturation
% 3.93/1.25  % (3702836)Time elapsed: 0.027 s
% 3.93/1.25  % (3702836)Peak memory usage: 87 MB
% 3.93/1.25  % (3702836)Instructions burned: 122 (million)
% 3.93/1.25  % (3702835)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2046424291:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.93/1.25  % (3702834)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=397834293:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.93/1.25  % (3702830)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=92564292:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.93/1.25  % (3702832)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2416865931:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.93/1.25  % (3702831)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=66168207:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.93/1.25  % (3702833)lrs+10_1_sil=8000:sp=occurrence:random_seed=2004466894:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.93/1.25  % (3702835)Refutation not found, incomplete strategy
% 3.93/1.25  % (3702835)------------------------------
% 3.93/1.25  % (3702835)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.25  % (3702835)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.25  % (3702835)CaDiCaL version: 2.1.3
% 3.93/1.25  % (3702835)Termination reason: Refutation not found, incomplete strategy
% 3.93/1.25  % (3702835)Time elapsed: 0.019 s
% 3.93/1.25  % (3702835)Peak memory usage: 87 MB
% 3.93/1.25  % (3702835)Instructions burned: 34 (million)
% 3.93/1.25  % (3702833)First to succeed.
% 3.93/1.25  % (3702833)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3702722"
% 3.93/1.25  % (3702834)Instruction limit reached! 
% 3.93/1.25  % (3702834)------------------------------
% 3.93/1.25  % (3702834)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.25  % (3702834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.25  % (3702834)CaDiCaL version: 2.1.3
% 3.93/1.25  % (3702834)Termination reason: Instruction limit
% 3.93/1.25  % (3702834)Termination phase: Saturation
% 3.93/1.25  % (3702834)Time elapsed: 0.061 s
% 3.93/1.25  % (3702834)Peak memory usage: 87 MB
% 3.93/1.25  % (3702834)Instructions burned: 115 (million)
% 3.93/1.25  % (3702870)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=311390401:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.93/1.25  % (3702870)Refutation not found, incomplete strategy
% 3.93/1.25  % (3702870)------------------------------
% 3.93/1.25  % (3702870)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.25  % (3702870)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.25  % (3702870)CaDiCaL version: 2.1.3
% 3.93/1.25  % (3702870)Termination reason: Refutation not found, incomplete strategy
% 3.93/1.25  % (3702870)Time elapsed: 0.003 s
% 3.93/1.25  % (3702870)Peak memory usage: 87 MB
% 3.93/1.25  % (3702870)Instructions burned: 8 (million)
% 3.93/1.25  % (3702872)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1006807419: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.93/1.25  % (3702872)Refutation not found, incomplete strategy
% 3.93/1.25  % (3702872)------------------------------
% 3.93/1.25  % (3702872)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.25  % (3702872)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.63/1.47  % (3702872)CaDiCaL version: 2.1.3
% 4.63/1.47  % (3702872)Termination reason: Refutation not found, incomplete strategy
% 4.63/1.47  % (3702872)Time elapsed: 0.005 s
% 4.63/1.47  % (3702872)Peak memory usage: 87 MB
% 4.63/1.47  % (3702872)Instructions burned: 6 (million)
% 4.63/1.47  % (3702835)------------------------------
% 4.63/1.47  % (3702835)------------------------------
% 4.63/1.47  % (3702870)------------------------------
% 4.63/1.47  % (3702870)------------------------------
% 4.63/1.47  % SZS status Satisfiable for theBenchmark
% 4.63/1.47  % SZS output start Saturation.
% See solution above
% 4.63/1.48  % SZS output start Definitions and Model Updates.
% 4.63/1.48  % SZS output end Definitions and Model Updates.
% 4.63/1.48  % (3702833)------------------------------
% 4.63/1.48  % (3702833)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.63/1.48  % (3702833)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.63/1.48  % (3702833)CaDiCaL version: 2.1.3
% 4.63/1.48  % (3702833)Termination reason: Satisfiable
% 4.63/1.48  % (3702833)Time elapsed: 0.006 s
% 4.63/1.48  % (3702833)Peak memory usage: 88 MB
% 4.63/1.48  % (3702833)Instructions burned: 7 (million)
% 4.63/1.48  % (3702833)------------------------------
% 4.63/1.48  % (3702833)------------------------------
% 4.63/1.48  % (3702722)Success in time 0.571 s
% 4.63/1.48  % Vampire exiting
%------------------------------------------------------------------------------