%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN740-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:24 PM UTC 2026
% Result : Satisfiable 2.98s 1.10s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(clause9,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv1(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv3(X2)
| ssPv4(X0) ) ).
cnf(u58,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv3(X1)
| ssPv2(skf1(X1))
| ssPv1(X1) ) ).
cnf(clause19,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv3(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ~ ssPv3(X0)
| ssPv1(X2) ) ).
cnf(u104,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv2(X0)
| ~ ssPv1(X2)
| ~ ssRr(X1,X0)
| ~ ssPv1(X1)
| ssPv1(skf1(X1)) ) ).
cnf(u65,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv3(X0)
| ~ ssPv2(X1)
| ~ ssPv3(X1)
| ssPv1(skf1(X1)) ) ).
cnf(u131,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv4(X1)
| ~ ssPv1(X0)
| ~ ssPv4(X0)
| ssPv3(skf1(X0)) ) ).
cnf(u205,negated_conjecture,
( ~ ssPv2(skf1(X0))
| ~ ssPv4(X0)
| ~ ssPv1(X0)
| ~ ssPv2(X0) ) ).
cnf(clause27,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv2(X1)
| ~ ssRr(X0,X2)
| ~ ssPv1(X2)
| ~ ssRr(X0,X1)
| ssPv2(X3)
| ssPv1(X0) ) ).
cnf(u42,negated_conjecture,
( ssPv2(skf1(X0))
| ~ ssPv4(X0)
| ssPv3(skf1(X0))
| ~ ssPv1(X0) ) ).
cnf(u112,negated_conjecture,
( ~ ssPv3(skf1(X0))
| ~ ssPv2(X0)
| ~ ssPv3(X0)
| ssPv1(skf1(X0)) ) ).
cnf(clause12,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv2(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv1(X2)
| ssPv3(X0) ) ).
cnf(clause22,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X2)
| ~ ssPv1(X0)
| ssPv2(X0) ) ).
cnf(u111,negated_conjecture,
( ~ ssPv4(X0)
| ~ ssPv2(X0)
| ~ ssPv3(X0)
| ~ ssPv1(X0) ) ).
cnf(clause24,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv2(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X2)
| ~ ssPv1(X0)
| ~ ssPv2(X0) ) ).
cnf(u34,negated_conjecture,
( ssPv4(skf1(X0))
| ~ ssPv3(X0)
| ~ ssPv1(X0)
| ssPv2(X0) ) ).
cnf(u192,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ~ ssPv2(X0)
| ~ ssPv4(X1)
| ~ ssPv4(X0)
| ssPv4(skf1(X0)) ) ).
cnf(u51,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv2(X1) ) ).
cnf(u91,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X0)
| ~ ssPv1(X2)
| ~ ssRr(X1,X0)
| ssPv1(skf1(X1))
| ssPv3(X1) ) ).
cnf(clause20,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv1(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ~ ssPv3(X0)
| ssPv1(X2) ) ).
cnf(clause30,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv2(X1)
| ~ ssRr(X0,X2)
| ~ ssPv1(X2)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv1(X3) ) ).
cnf(u32,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv1(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ssPv1(X2) ) ).
cnf(u165,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv3(X0)
| ~ ssPv2(X1)
| ssPv3(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv1(X1) ) ).
cnf(clause3,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ~ ssPv3(X0)
| ssPv4(X1)
| ssPv2(X0) ) ).
cnf(u60,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv3(X0)
| ~ ssPv2(X1)
| ~ ssPv4(X1)
| ssPv1(skf1(X1)) ) ).
cnf(u88,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X0)
| ~ ssPv2(X2)
| ~ ssRr(X1,X0)
| ssPv3(skf1(X1))
| ssPv4(X1) ) ).
cnf(clause21,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X2)
| ~ ssPv4(X0)
| ssPv2(X0) ) ).
cnf(u177,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv2(X0)
| ~ ssPv2(X1)
| ssPv4(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv3(X1) ) ).
cnf(u98,negated_conjecture,
( ~ ssPv4(skf1(X0))
| ~ ssPv3(X0)
| ssPv3(skf1(X0)) ) ).
cnf(clause31,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv2(X1)
| ~ ssRr(X0,X2)
| ~ ssPv1(X2)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ssPv4(X3) ) ).
cnf(u173,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssPv2(X0)
| ~ ssRr(X1,X0)
| ~ ssPv2(X1)
| ssPv4(skf1(X1)) ) ).
cnf(clause11,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv3(X2)
| ssPv3(X0) ) ).
cnf(u96,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv3(X0)
| ~ ssPv2(X2)
| ~ ssRr(X1,X0)
| ~ ssPv2(X1)
| ssPv3(skf1(X1)) ) ).
cnf(clause29,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv4(X1)
| ~ ssRr(X0,X2)
| ~ ssPv3(X2)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv4(X3) ) ).
cnf(u185,negated_conjecture,
( ssPv3(skf1(X0))
| ~ ssPv4(X0)
| ~ ssPv1(X0)
| ~ ssPv2(X0) ) ).
cnf(u39,negated_conjecture,
( ssPv4(skf1(X0))
| ~ ssPv4(X0)
| ~ ssPv3(X0)
| ssPv3(skf1(X0)) ) ).
cnf(u41,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv3(X1)
| ssPv4(skf1(X1))
| ssPv4(X1) ) ).
cnf(clause6,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ~ ssPv4(X0)
| ssPv3(X1)
| ssPv2(X2) ) ).
cnf(u162,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssPv4(X0)
| ~ ssRr(X1,X0)
| ~ ssPv1(X1)
| ssPv4(skf1(X1)) ) ).
cnf(clause8,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv1(X1)
| ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ssPv1(X2)
| ssPv4(X0) ) ).
cnf(clause18,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ~ ssPv3(X0)
| ssPv3(X2) ) ).
cnf(clause16,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ssPv2(X2)
| ssPv1(X0) ) ).
cnf(clause5,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ~ ssPv4(X0)
| ssPv4(X1)
| ssPv3(X2) ) ).
cnf(u158,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ~ ssPv3(X0)
| ~ ssRr(X1,X0)
| ~ ssPv2(X1)
| ssPv3(skf1(X1)) ) ).
cnf(u75,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv1(X1)
| ssPv2(X1) ) ).
cnf(clause4,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv1(X1)
| ~ ssPv1(X0)
| ~ ssPv2(X0)
| ~ ssPv3(X0) ) ).
cnf(u49,negated_conjecture,
( ~ ssPv1(skf1(X0))
| ~ ssPv1(X0)
| ssPv3(skf1(X0))
| ssPv4(X0) ) ).
cnf(u93,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv2(X0)
| ~ ssPv1(X2)
| ~ ssRr(X1,X0)
| ssPv2(skf1(X1))
| ssPv1(X1) ) ).
cnf(clause14,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ssPv3(X2)
| ssPv2(X0) ) ).
cnf(u59,negated_conjecture,
( ~ ssPv2(skf1(X0))
| ~ ssPv1(X0)
| ssPv1(skf1(X0))
| ssPv3(X0) ) ).
cnf(u103,negated_conjecture,
( ssPv3(skf1(X0))
| ~ ssPv3(X0)
| ~ ssPv4(X0) ) ).
cnf(u33,negated_conjecture,
( ssPv3(skf1(X0))
| ~ ssPv3(X0)
| ssPv1(X0)
| ssPv2(X0) ) ).
cnf(clause26,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv3(X1)
| ~ ssRr(X0,X2)
| ~ ssPv1(X2)
| ~ ssRr(X0,X1)
| ssPv1(X3)
| ssPv3(X0) ) ).
cnf(u115,negated_conjecture,
( ~ ssPv2(skf1(X0))
| ~ ssPv3(skf1(X0))
| ~ ssPv1(skf1(X0))
| ~ ssPv3(X0)
| ~ ssPv1(X0) ) ).
cnf(u44,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv1(X0)
| ~ ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv4(X1) ) ).
cnf(u72,negated_conjecture,
( ssPv3(skf1(X0))
| ssPv2(X0)
| ~ ssPv3(X0) ) ).
cnf(u35,negated_conjecture,
( ~ ssPv1(skf1(X0))
| ~ ssPv1(X0)
| ~ ssPv2(X0)
| ~ ssPv3(X0) ) ).
cnf(u161,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv2(X0)
| ssPv2(skf1(X1))
| ~ ssPv4(X1)
| ~ ssPv2(X1)
| ~ ssPv3(X1) ) ).
cnf(u82,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv2(X0)
| ~ ssPv1(X1)
| ~ ssPv2(X1) ) ).
cnf(clause15,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv3(X2)
| ssPv2(X0)
| ssPv3(X0) ) ).
cnf(clause17,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv3(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ~ ssPv4(X0)
| ssPv1(X2) ) ).
cnf(u202,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ~ ssPv4(X0)
| ~ ssPv1(X0)
| ~ ssPv2(X1) ) ).
cnf(u52,negated_conjecture,
( ~ ssPv4(skf1(X0))
| ~ ssPv1(X0)
| ssPv3(skf1(X0))
| ssPv3(X0) ) ).
cnf(u80,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv1(X1)
| ~ ssPv2(X1) ) ).
cnf(clause13,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X2)
| ssPv3(X0)
| ssPv4(X0) ) ).
cnf(u62,negated_conjecture,
( ssPv1(skf1(X0))
| ~ ssPv1(X0)
| ssPv3(X0)
| ~ ssPv4(X0)
| ssPv3(skf1(X0)) ) ).
cnf(clause23,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv2(X2)
| ~ ssPv1(X0)
| ~ ssPv2(X0) ) ).
cnf(u108,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv2(X0)
| ~ ssPv1(X2)
| ~ ssRr(X1,X0)
| ~ ssPv2(X1)
| ssPv4(skf1(X1)) ) ).
cnf(clause25,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv4(X1)
| ~ ssRr(X0,X2)
| ~ ssPv2(X2)
| ~ ssRr(X0,X1)
| ssPv3(X3)
| ssPv4(X0) ) ).
cnf(u145,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ~ ssPv4(X0)
| ~ ssRr(X1,X0)
| ssPv3(skf1(X1))
| ssPv4(X1) ) ).
cnf(u146,negated_conjecture,
( ~ ssPv4(skf1(X0))
| ~ ssPv1(X0)
| ~ ssPv4(X0)
| ssPv3(skf1(X0)) ) ).
cnf(u53,negated_conjecture,
( ~ ssPv3(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ssPv2(X1)
| ssPv3(X1) ) ).
cnf(u81,negated_conjecture,
( ~ ssPv4(skf1(X0))
| ~ ssPv3(X0)
| ssPv2(skf1(X0))
| ssPv1(X0) ) ).
cnf(clause2,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ssPv3(X1)
| ssPv1(X0)
| ssPv2(X0) ) ).
cnf(u63,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv2(X1)
| ~ ssPv3(X1)
| ssPv3(skf1(X1)) ) ).
cnf(u46,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv1(X1)
| ssPv3(skf1(X1))
| ssPv3(X1) ) ).
cnf(u144,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv4(X0)
| ssPv3(skf1(X0))
| ~ ssPv1(X0)
| ~ ssPv2(X1)
| ~ ssPv2(X0) ) ).
cnf(u43,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv1(X0)
| ~ ssPv3(X1)
| ssPv1(skf1(X1))
| ssPv4(X1) ) ).
cnf(u87,negated_conjecture,
( ssPv2(skf1(X0))
| ~ ssPv3(X0)
| ~ ssPv4(X0)
| ssPv3(skf1(X0)) ) ).
cnf(u172,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv1(X1)
| ssPv4(skf1(X1))
| ~ ssPv3(X1) ) ).
cnf(u99,negated_conjecture,
( ~ ssRr(X1,X2)
| ~ ssPv4(X0)
| ~ ssPv3(X2)
| ~ ssRr(X1,X0)
| ~ ssPv1(X1)
| ssPv4(skf1(X1)) ) ).
cnf(clause28,negated_conjecture,
( ~ ssRr(X0,X3)
| ~ ssPv3(X1)
| ~ ssRr(X0,X2)
| ~ ssPv2(X2)
| ~ ssRr(X0,X1)
| ~ ssPv2(X0)
| ssPv3(X3) ) ).
cnf(u38,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ~ ssPv4(X0)
| ssPv4(X1)
| ssPv3(skf1(X0)) ) ).
cnf(u66,negated_conjecture,
( ~ ssPv4(skf1(X0))
| ~ ssPv1(X0)
| ssPv3(skf1(X0))
| ssPv2(X0) ) ).
cnf(u40,negated_conjecture,
( ~ ssRr(X0,X1)
| ~ ssPv1(X0)
| ~ ssPv4(X0)
| ssPv3(X1)
| ssPv2(skf1(X0)) ) ).
cnf(clause1,negated_conjecture,
ssRr(X0,skf1(X0)) ).
cnf(u50,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ssPv3(X1)
| ssPv4(X1) ) ).
cnf(u206,negated_conjecture,
( ~ ssPv2(skf1(X0))
| ~ ssPv2(X0)
| ssPv4(skf1(X0))
| ~ ssPv4(X0)
| ~ ssPv3(X0) ) ).
cnf(u190,negated_conjecture,
( ssPv1(skf1(X0))
| ~ ssPv1(X0)
| ~ ssPv2(X0)
| ~ ssPv4(X0) ) ).
cnf(u107,negated_conjecture,
( ssPv1(skf1(X0))
| ~ ssPv4(X0)
| ~ ssPv2(X0)
| ~ ssPv3(X0) ) ).
cnf(u36,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv1(X0)
| ~ ssPv2(X1)
| ssPv1(skf1(X1)) ) ).
cnf(u153,negated_conjecture,
( ~ ssPv1(skf1(X1))
| ~ ssPv2(X0)
| ~ ssRr(X1,X0)
| ssPv2(skf1(X1))
| ssPv1(X1) ) ).
cnf(u74,negated_conjecture,
( ~ ssPv2(skf1(X1))
| ~ ssRr(X1,X0)
| ~ ssPv4(X0)
| ~ ssPv4(X1)
| ssPv2(X1) ) ).
cnf(clause7,negated_conjecture,
( ~ ssRr(X0,X2)
| ~ ssPv4(X1)
| ~ ssRr(X0,X1)
| ~ ssPv3(X0)
| ssPv4(X2)
| ssPv4(X0) ) ).
cnf(u48,negated_conjecture,
( ~ ssRr(X1,X0)
| ~ ssPv2(X0)
| ~ ssPv1(X1)
| ssPv1(skf1(X1))
| ssPv3(X1) ) ).
cnf(u92,negated_conjecture,
( ~ ssPv3(skf1(X0))
| ~ ssPv2(X0)
| ~ ssPv4(X0)
| ssPv1(skf1(X0)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN740-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 16:51:49 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 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.98/1.10 % (303344)Input is clausal, will run a generic CNF schedule.
% 2.98/1.10 % (303353)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1932164388:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.98/1.10 % (303353)Refutation not found, incomplete strategy
% 2.98/1.10 % (303353)------------------------------
% 2.98/1.10 % (303353)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.10 % (303353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.10 % (303353)CaDiCaL version: 2.1.3
% 2.98/1.10 % (303353)Termination reason: Refutation not found, incomplete strategy
% 2.98/1.10 % (303353)Time elapsed: 0.028 s
% 2.98/1.10 % (303353)Peak memory usage: 87 MB
% 2.98/1.10 % (303353)Instructions burned: 99 (million)
% 2.98/1.10 % (303354)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=496845605:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.98/1.10 % (303349)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=3897306378:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.98/1.10 % (303352)lrs+10_1_sil=8000:sp=occurrence:random_seed=3901357564:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.98/1.10 % (303355)dis-21_1_sil=8000:lcm=predicate:random_seed=113174707: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.98/1.10 % (303351)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1999180922:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.98/1.10 % (303350)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1691011693:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.98/1.10 % (303354)Refutation not found, incomplete strategy
% 2.98/1.10 % (303354)------------------------------
% 2.98/1.10 % (303354)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.10 % (303354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.10 % (303354)CaDiCaL version: 2.1.3
% 2.98/1.10 % (303354)Termination reason: Refutation not found, incomplete strategy
% 2.98/1.10 % (303354)Time elapsed: 0.002 s
% 2.98/1.10 % (303354)Peak memory usage: 87 MB
% 2.98/1.10 % (303354)Instructions burned: 3 (million)
% 2.98/1.10 % (303352)First to succeed.
% 2.98/1.10 % (303352)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-303344"
% 2.98/1.10 % (303355)Instruction limit reached!
% 2.98/1.10 % (303355)------------------------------
% 2.98/1.10 % (303355)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.10 % (303355)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.10 % (303355)CaDiCaL version: 2.1.3
% 2.98/1.10 % (303355)Termination reason: Instruction limit
% 2.98/1.10 % (303355)Termination phase: Saturation
% 2.98/1.10 % (303355)Time elapsed: 0.054 s
% 2.98/1.10 % (303355)Peak memory usage: 87 MB
% 2.98/1.10 % (303355)Instructions burned: 119 (million)
% 2.98/1.10 % (303353)------------------------------
% 2.98/1.10 % (303353)------------------------------
% 2.98/1.10 % (303363)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=1850949411:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 2.98/1.10 % (303363)Refutation not found, incomplete strategy
% 2.98/1.10 % (303363)------------------------------
% 2.98/1.10 % (303363)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.98/1.10 % (303363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.98/1.10 % (303363)CaDiCaL version: 2.1.3
% 2.98/1.10 % (303363)Termination reason: Refutation not found, incomplete strategy
% 2.98/1.10 % (303363)Time elapsed: 0.006 s
% 2.98/1.10 % (303363)Peak memory usage: 87 MB
% 2.98/1.10 % (303363)Instructions burned: 9 (million)
% 2.98/1.10 % (303354)------------------------------
% 2.98/1.10 % (303354)------------------------------
% 2.98/1.10 % SZS status Satisfiable for theBenchmark
% 2.98/1.10 % SZS output start Saturation.
% See solution above
% 0.19/1.30 % SZS output start Definitions and Model Updates.
% 0.19/1.30 % SZS output end Definitions and Model Updates.
% 0.19/1.30 % (303352)------------------------------
% 0.19/1.30 % (303352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.19/1.30 % (303352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/1.30 % (303352)CaDiCaL version: 2.1.3
% 0.19/1.30 % (303352)Termination reason: Satisfiable
% 0.19/1.30 % (303352)Time elapsed: 0.006 s
% 0.19/1.30 % (303352)Peak memory usage: 88 MB
% 0.19/1.30 % (303352)Instructions burned: 9 (million)
% 0.19/1.30 % (303352)------------------------------
% 0.19/1.30 % (303352)------------------------------
% 0.19/1.30 % (303344)Success in time 0.433 s
% 0.19/1.30 % Vampire exiting
%------------------------------------------------------------------------------