%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS011-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:41:27 AM UTC 2026
% Result : Satisfiable 2.07s 0.93s
% Output : Saturation 2.07s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_9,axiom,
( ~ e(X0)
| ~ c(X0) ) ).
cnf(u58,negated_conjecture,
~ r2least(exists) ).
cnf(clause_19,axiom,
( ~ t1(X1,X2)
| ~ r1(X0,X1)
| ~ equalish(u9r2(X1,X0),u9r1(X1,X0))
| f1(X0)
| ~ c(X2) ) ).
cnf(clause_37,axiom,
( ~ f3(X3)
| equalish(X0,X2)
| equalish(X1,X2)
| equalish(X0,X1)
| ~ t(u11r4(X3),X0)
| ~ t(u11r4(X3),X1)
| ~ t(u11r4(X3),X2) ) ).
cnf(u65,axiom,
( ~ f3(X0)
| t(u11r4(X0),u11r5(X0)) ) ).
cnf(clause_47,axiom,
( ~ f(X0)
| f1(X0) ) ).
cnf(clause_27,axiom,
( ~ f2(X3)
| equalish(X0,X2)
| equalish(X1,X2)
| equalish(X0,X1)
| ~ t(u10r4(X3),X0)
| ~ t(u10r4(X3),X1)
| ~ t(u10r4(X3),X2) ) ).
cnf(u71,axiom,
( equalish(X0,X1)
| ~ r(X2,X0)
| ~ r(X2,X1)
| ~ equalish(u14r2(X2),u14r1(X2)) ) ).
cnf(clause_45,axiom,
( ~ f(X0)
| f3(X0) ) ).
cnf(u73,axiom,
( r(X2,u14r1(X2))
| ~ r(X2,X0)
| ~ r(X2,X1)
| equalish(X0,X1) ) ).
cnf(u55,negated_conjecture,
f3(exists) ).
cnf(u83,axiom,
( ~ r3(X1,u11r4(X0))
| t(u11r4(X0),u11r2(u11r4(X0),X1))
| f3(X1)
| ~ e(u11r5(X0))
| ~ f3(X0) ) ).
cnf(u57,negated_conjecture,
f1(exists) ).
cnf(clause_22,axiom,
( ~ t1(X1,X2)
| t(X1,u9r1(X1,X0))
| ~ r1(X0,X1)
| f1(X0)
| ~ c(X2) ) ).
cnf(clause_24,axiom,
( ~ t1(X1,X2)
| t(X1,u9r3(X1,X0))
| ~ r1(X0,X1)
| f1(X0)
| ~ c(X2) ) ).
cnf(clause_34,axiom,
( ~ t2(X1,X2)
| t(X1,u10r3(X1,X0))
| ~ r2(X0,X1)
| f2(X0)
| ~ d(X2) ) ).
cnf(u91,axiom,
( ~ r3(X0,u11r4(X1))
| ~ equalish(u11r2(u11r4(X1),X0),u11r1(u11r4(X1),X0))
| f3(X0)
| ~ e(u11r5(X1))
| ~ f3(X1) ) ).
cnf(clause_20,axiom,
( ~ t1(X1,X2)
| ~ r1(X0,X1)
| ~ equalish(u9r3(X1,X0),u9r1(X1,X0))
| f1(X0)
| ~ c(X2) ) ).
cnf(clause_30,axiom,
( ~ t2(X1,X2)
| ~ r2(X0,X1)
| ~ equalish(u10r3(X1,X0),u10r1(X1,X0))
| f2(X0)
| ~ d(X2) ) ).
cnf(clause_32,axiom,
( ~ t2(X1,X2)
| t(X1,u10r1(X1,X0))
| ~ r2(X0,X1)
| f2(X0)
| ~ d(X2) ) ).
cnf(u76,axiom,
( ~ r1(X1,u9r4(X0))
| t(u9r4(X0),u9r2(u9r4(X0),X1))
| f1(X1)
| ~ c(u9r5(X0))
| ~ f1(X0) ) ).
cnf(clause_42,axiom,
( ~ t3(X1,X2)
| t(X1,u11r1(X1,X0))
| ~ r3(X0,X1)
| f3(X0)
| ~ e(X2) ) ).
cnf(u86,axiom,
( ~ r1(X0,u9r4(X1))
| ~ equalish(u9r3(u9r4(X1),X0),u9r1(u9r4(X1),X0))
| f1(X0)
| ~ c(u9r5(X1))
| ~ f1(X1) ) ).
cnf(clause_3,axiom,
( r(X0,X1)
| ~ r1(X0,X1) ) ).
cnf(u60,axiom,
( ~ e(u10r5(X0))
| ~ f2(X0) ) ).
cnf(u88,axiom,
( ~ r2(X0,u10r4(X1))
| ~ equalish(u10r2(u10r4(X1),X0),u10r1(u10r4(X1),X0))
| f2(X0)
| ~ d(u10r5(X1))
| ~ f2(X1) ) ).
cnf(clause_21,axiom,
( ~ t1(X1,X2)
| ~ r1(X0,X1)
| ~ equalish(u9r3(X1,X0),u9r2(X1,X0))
| f1(X0)
| ~ c(X2) ) ).
cnf(u98,negated_conjecture,
( equalish(X0,X2)
| equalish(X2,X1)
| equalish(X0,X1)
| ~ t(u11r4(exists),X0)
| ~ t(u11r4(exists),X2)
| ~ t(u11r4(exists),X1) ) ).
cnf(clause_31,axiom,
( ~ t2(X1,X2)
| ~ r2(X0,X1)
| ~ equalish(u10r3(X1,X0),u10r2(X1,X0))
| f2(X0)
| ~ d(X2) ) ).
cnf(u84,axiom,
( ~ r3(X1,u11r4(X0))
| t(u11r4(X0),u11r3(u11r4(X0),X1))
| f3(X1)
| ~ e(u11r5(X0))
| ~ f3(X0) ) ).
cnf(clause_11,axiom,
( ~ d(X0)
| ~ e(X0) ) ).
cnf(u96,negated_conjecture,
( equalish(X0,X2)
| equalish(X2,X1)
| equalish(X0,X1)
| ~ t(u9r4(exists),X0)
| ~ t(u9r4(exists),X2)
| ~ t(u9r4(exists),X1) ) ).
cnf(clause_29,axiom,
( ~ t2(X1,X2)
| ~ r2(X0,X1)
| ~ equalish(u10r2(X1,X0),u10r1(X1,X0))
| f2(X0)
| ~ d(X2) ) ).
cnf(clause_39,axiom,
( ~ t3(X1,X2)
| ~ r3(X0,X1)
| ~ equalish(u11r2(X1,X0),u11r1(X1,X0))
| f3(X0)
| ~ e(X2) ) ).
cnf(clause_41,axiom,
( ~ t3(X1,X2)
| ~ r3(X0,X1)
| ~ equalish(u11r3(X1,X0),u11r2(X1,X0))
| f3(X0)
| ~ e(X2) ) ).
cnf(u85,axiom,
( ~ r1(X0,u9r4(X1))
| ~ equalish(u9r2(u9r4(X1),X0),u9r1(u9r4(X1),X0))
| f1(X0)
| ~ c(u9r5(X1))
| ~ f1(X1) ) ).
cnf(clause_6,axiom,
( ~ t1(X0,X1)
| t(X0,X1) ) ).
cnf(clause_51,axiom,
( ~ r2least(X0)
| ~ equalish(u14r2(X0),u14r1(X0)) ) ).
cnf(clause_8,axiom,
( ~ t3(X0,X1)
| t(X0,X1) ) ).
cnf(u97,negated_conjecture,
( equalish(X0,X2)
| equalish(X2,X1)
| equalish(X0,X1)
| ~ t(u10r4(exists),X0)
| ~ t(u10r4(exists),X2)
| ~ t(u10r4(exists),X1) ) ).
cnf(clause_18,axiom,
( r1(X0,u9r4(X0))
| ~ f1(X0) ) ).
cnf(u75,negated_conjecture,
t(u10r4(exists),u10r5(exists)) ).
cnf(clause_4,axiom,
( r(X0,X1)
| ~ r2(X0,X1) ) ).
cnf(clause_49,axiom,
( ~ g(X0)
| r2least(X0) ) ).
cnf(u93,axiom,
( ~ r3(X0,u11r4(X1))
| ~ equalish(u11r3(u11r4(X1),X0),u11r2(u11r4(X1),X0))
| f3(X0)
| ~ e(u11r5(X1))
| ~ f3(X1) ) ).
cnf(clause_16,axiom,
( t1(u9r4(X0),u9r5(X0))
| ~ f1(X0) ) ).
cnf(clause_26,axiom,
( t2(u10r4(X0),u10r5(X0))
| ~ f2(X0) ) ).
cnf(u70,negated_conjecture,
( equalish(X0,X1)
| ~ r(exists,X0)
| ~ r(exists,X1) ) ).
cnf(clause_44,axiom,
( ~ t3(X1,X2)
| t(X1,u11r3(X1,X0))
| ~ r3(X0,X1)
| f3(X0)
| ~ e(X2) ) ).
cnf(u72,axiom,
( r(X2,u14r2(X2))
| ~ r(X2,X0)
| ~ r(X2,X1)
| equalish(X0,X1) ) ).
cnf(clause_5,axiom,
( r(X0,X1)
| ~ r3(X0,X1) ) ).
cnf(clause_54,axiom,
( r2least(X0)
| equalish(X1,X2)
| ~ r(X0,X1)
| ~ r(X0,X2) ) ).
cnf(u82,axiom,
( ~ r3(X1,u11r4(X0))
| t(u11r4(X0),u11r1(u11r4(X0),X1))
| f3(X1)
| ~ e(u11r5(X0))
| ~ f3(X0) ) ).
cnf(clause_15,axiom,
( c(u9r5(X0))
| ~ f1(X0) ) ).
cnf(u56,negated_conjecture,
f2(exists) ).
cnf(clause_17,axiom,
( ~ f1(X3)
| equalish(X0,X2)
| equalish(X1,X2)
| equalish(X0,X1)
| ~ t(u9r4(X3),X0)
| ~ t(u9r4(X3),X1)
| ~ t(u9r4(X3),X2) ) ).
cnf(u78,negated_conjecture,
t(u11r4(exists),u11r5(exists)) ).
cnf(clause_52,axiom,
( ~ r2least(X0)
| r(X0,u14r1(X0)) ) ).
cnf(u80,axiom,
( ~ r2(X1,u10r4(X0))
| t(u10r4(X0),u10r2(u10r4(X0),X1))
| f2(X1)
| ~ d(u10r5(X0))
| ~ f2(X0) ) ).
cnf(u62,axiom,
( ~ c(u11r5(X0))
| ~ f3(X0) ) ).
cnf(u90,axiom,
( ~ r2(X0,u10r4(X1))
| ~ equalish(u10r3(u10r4(X1),X0),u10r2(u10r4(X1),X0))
| f2(X0)
| ~ d(u10r5(X1))
| ~ f2(X1) ) ).
cnf(clause_23,axiom,
( ~ t1(X1,X2)
| t(X1,u9r2(X1,X0))
| ~ r1(X0,X1)
| f1(X0)
| ~ c(X2) ) ).
cnf(clause_25,axiom,
( d(u10r5(X0))
| ~ f2(X0) ) ).
cnf(clause_35,axiom,
( e(u11r5(X0))
| ~ f3(X0) ) ).
cnf(u79,axiom,
( ~ r2(X1,u10r4(X0))
| t(u10r4(X0),u10r1(u10r4(X0),X1))
| f2(X1)
| ~ d(u10r5(X0))
| ~ f2(X0) ) ).
cnf(clause_53,axiom,
( ~ r2least(X0)
| r(X0,u14r2(X0)) ) ).
cnf(u81,axiom,
( ~ r2(X1,u10r4(X0))
| t(u10r4(X0),u10r3(u10r4(X0),X1))
| f2(X1)
| ~ d(u10r5(X0))
| ~ f2(X0) ) ).
cnf(clause_2,negated_conjecture,
~ g(exists) ).
cnf(u63,axiom,
( ~ f1(X0)
| t(u9r4(X0),u9r5(X0)) ) ).
cnf(clause_33,axiom,
( ~ t2(X1,X2)
| t(X1,u10r2(X1,X0))
| ~ r2(X0,X1)
| f2(X0)
| ~ d(X2) ) ).
cnf(u77,axiom,
( ~ r1(X1,u9r4(X0))
| t(u9r4(X0),u9r3(u9r4(X0),X1))
| f1(X1)
| ~ c(u9r5(X0))
| ~ f1(X0) ) ).
cnf(clause_43,axiom,
( ~ t3(X1,X2)
| t(X1,u11r2(X1,X0))
| ~ r3(X0,X1)
| f3(X0)
| ~ e(X2) ) ).
cnf(u87,axiom,
( ~ r1(X0,u9r4(X1))
| ~ equalish(u9r3(u9r4(X1),X0),u9r2(u9r4(X1),X0))
| f1(X0)
| ~ c(u9r5(X1))
| ~ f1(X1) ) ).
cnf(u61,axiom,
( ~ c(u10r5(X0))
| ~ f2(X0) ) ).
cnf(u89,axiom,
( ~ r2(X0,u10r4(X1))
| ~ equalish(u10r3(u10r4(X1),X0),u10r1(u10r4(X1),X0))
| f2(X0)
| ~ d(u10r5(X1))
| ~ f2(X1) ) ).
cnf(clause_10,axiom,
( ~ d(X0)
| ~ c(X0) ) ).
cnf(clause_28,axiom,
( r2(X0,u10r4(X0))
| ~ f2(X0) ) ).
cnf(clause_38,axiom,
( r3(X0,u11r4(X0))
| ~ f3(X0) ) ).
cnf(u66,negated_conjecture,
t(u9r4(exists),u9r5(exists)) ).
cnf(clause_40,axiom,
( ~ t3(X1,X2)
| ~ r3(X0,X1)
| ~ equalish(u11r3(X1,X0),u11r1(X1,X0))
| f3(X0)
| ~ e(X2) ) ).
cnf(clause_1,negated_conjecture,
f(exists) ).
cnf(clause_50,axiom,
( g(X0)
| ~ r2least(X0) ) ).
cnf(clause_36,axiom,
( t3(u11r4(X0),u11r5(X0))
| ~ f3(X0) ) ).
cnf(u64,axiom,
( ~ f2(X0)
| t(u10r4(X0),u10r5(X0)) ) ).
cnf(clause_46,axiom,
( ~ f(X0)
| f2(X0) ) ).
cnf(u74,axiom,
( ~ r1(X1,u9r4(X0))
| t(u9r4(X0),u9r1(u9r4(X0),X1))
| f1(X1)
| ~ c(u9r5(X0))
| ~ f1(X0) ) ).
cnf(clause_7,axiom,
( ~ t2(X0,X1)
| t(X0,X1) ) ).
cnf(clause_48,axiom,
( f(X0)
| ~ f1(X0)
| ~ f2(X0)
| ~ f3(X0) ) ).
cnf(u92,axiom,
( ~ r3(X0,u11r4(X1))
| ~ equalish(u11r3(u11r4(X1),X0),u11r1(u11r4(X1),X0))
| f3(X0)
| ~ e(u11r5(X1))
| ~ f3(X1) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS011-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.35 % Computer : n012.cluster.edu
% 0.04/0.35 % Model : x86_64 x86_64
% 0.04/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.35 % Memory : 8046.5625MB
% 0.04/0.35 % OS : Linux 6.8.0-71-generic
% 0.04/0.35 % CPULimit : 300
% 0.04/0.35 % WCLimit : 300
% 0.04/0.35 % DateTime : Sun Sep 27 13:14:50 UTC 2026
% 0.04/0.35 % CPUTime :
% 0.04/0.35 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.37 Running first-order theorem proving
% 0.04/0.37 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
% 2.07/0.93 % (2385442)Input is clausal, will run a generic CNF schedule.
% 2.07/0.93 % (2385481)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3970525736:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 2.07/0.93 % (2385478)lrs+10_1_sil=8000:sp=occurrence:random_seed=98385380:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 2.07/0.93 % (2385483)dis-21_1_sil=8000:lcm=predicate:random_seed=4155284822:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 2.07/0.93 % (2385475)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=2105787470:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 2.07/0.93 % (2385476)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=871681430:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 2.07/0.93 % (2385480)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3998716586:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 2.07/0.93 % (2385477)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2625926064:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 2.07/0.93 % (2385480)Refutation not found, incomplete strategy
% 2.07/0.93 % (2385480)------------------------------
% 2.07/0.93 % (2385480)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.93 % (2385480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.93 % (2385480)CaDiCaL version: 2.1.3
% 2.07/0.93 % (2385480)Termination reason: Refutation not found, incomplete strategy
% 2.07/0.93 % (2385480)Time elapsed: 0.0000 s
% 2.07/0.93 % (2385480)Peak memory usage: 87 MB
% 2.07/0.93 % (2385478)Refutation not found, incomplete strategy
% 2.07/0.93 % (2385478)------------------------------
% 2.07/0.93 % (2385478)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.93 % (2385478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.93 % (2385478)CaDiCaL version: 2.1.3
% 2.07/0.93 % (2385478)Termination reason: Refutation not found, incomplete strategy
% 2.07/0.93 % (2385478)Time elapsed: 0.001 s
% 2.07/0.93 % (2385478)Peak memory usage: 87 MB
% 2.07/0.93 % (2385483)First to succeed.
% 2.07/0.93 % (2385483)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2385442"
% 2.07/0.93 % (2385481)Instruction limit reached!
% 2.07/0.93 % (2385481)------------------------------
% 2.07/0.93 % (2385481)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.93 % (2385481)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.93 % (2385481)CaDiCaL version: 2.1.3
% 2.07/0.93 % (2385481)Termination reason: Instruction limit
% 2.07/0.93 % (2385481)Termination phase: Saturation
% 2.07/0.93 % (2385481)Time elapsed: 0.037 s
% 2.07/0.93 % (2385481)Peak memory usage: 87 MB
% 2.07/0.93 % (2385481)Instructions burned: 183 (million)
% 2.07/0.93 % (2385524)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=2312694238:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.07/0.93 % (2385524)Refutation not found, incomplete strategy
% 2.07/0.93 % (2385524)------------------------------
% 2.07/0.93 % (2385524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.93 % (2385524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.93 % (2385524)CaDiCaL version: 2.1.3
% 2.07/0.93 % (2385524)Termination reason: Refutation not found, incomplete strategy
% 2.07/0.93 % (2385524)Time elapsed: 0.001 s
% 2.07/0.93 % (2385524)Peak memory usage: 87 MB
% 2.07/0.93 % (2385524)Instructions burned: 1 (million)
% 2.07/0.93 % (2385480)------------------------------
% 2.07/0.93 % (2385480)------------------------------
% 2.07/0.93 % (2385478)------------------------------
% 2.07/0.93 % (2385478)------------------------------
% 2.07/0.93 % SZS status Satisfiable for theBenchmark
% 2.07/0.93 % SZS output start Saturation.
% See solution above
% 2.07/0.93 % SZS output start Definitions and Model Updates.
% 2.07/0.93 % SZS output end Definitions and Model Updates.
% 2.07/0.93 % (2385483)------------------------------
% 2.07/0.93 % (2385483)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.07/0.93 % (2385483)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.07/0.93 % (2385483)CaDiCaL version: 2.1.3
% 2.07/0.93 % (2385483)Termination reason: Satisfiable
% 2.07/0.93 % (2385483)Time elapsed: 0.002 s
% 2.07/0.93 % (2385483)Peak memory usage: 87 MB
% 2.07/0.93 % (2385483)Instructions burned: 5 (million)
% 2.07/0.93 % (2385483)------------------------------
% 2.07/0.93 % (2385483)------------------------------
% 2.07/0.93 % (2385442)Success in time 0.256 s
% 2.07/0.93 % Vampire exiting
%------------------------------------------------------------------------------