TSTP Solution File: KRS011-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS011-1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:21:40 EDT 2024
% Result : Satisfiable 0.15s 0.38s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u123,negated_conjecture,
( ~ t(u10r4(exists),X0)
| equalish(X0,u10r5(exists))
| equalish(u10r5(exists),X0)
| equalish(u10r5(exists),u10r5(exists)) ) ).
cnf(u105,negated_conjecture,
( ~ r2(X0,u10r4(exists))
| f2(X0)
| t(u10r4(exists),u10r3(u10r4(exists),X0)) ) ).
cnf(u102,negated_conjecture,
( ~ r2(X0,u10r4(exists))
| f2(X0)
| t(u10r4(exists),u10r2(u10r4(exists),X0)) ) ).
cnf(u128,negated_conjecture,
( ~ t(u11r4(exists),X0)
| equalish(X0,u11r5(exists))
| equalish(u11r5(exists),X0)
| equalish(u11r5(exists),u11r5(exists)) ) ).
cnf(clause_7,axiom,
( ~ t2(X0,X1)
| t(X0,X1) ) ).
cnf(u117,negated_conjecture,
( ~ t(u9r4(exists),X1)
| equalish(u9r5(exists),X1)
| equalish(X0,X1)
| equalish(u9r5(exists),X0)
| ~ t(u9r4(exists),X0) ) ).
cnf(clause_36,axiom,
( ~ f3(X0)
| t3(u11r4(X0),u11r5(X0)) ) ).
cnf(clause_29,axiom,
( ~ equalish(u10r2(X1,X0),u10r1(X1,X0))
| f2(X0)
| ~ t2(X1,X5)
| ~ r2(X0,X1)
| ~ d(X5) ) ).
cnf(clause_10,axiom,
( ~ d(X0)
| ~ c(X0) ) ).
cnf(clause_3,axiom,
( ~ r1(X0,X1)
| r(X0,X1) ) ).
cnf(u120,negated_conjecture,
equalish(u9r5(exists),u9r5(exists)) ).
cnf(clause_43,axiom,
( ~ t3(X1,X5)
| f3(X0)
| ~ e(X5)
| ~ r3(X0,X1)
| t(X1,u11r2(X1,X0)) ) ).
cnf(clause_32,axiom,
( ~ t2(X1,X5)
| f2(X0)
| ~ d(X5)
| ~ r2(X0,X1)
| t(X1,u10r1(X1,X0)) ) ).
cnf(clause_25,axiom,
( ~ f2(X0)
| d(u10r5(X0)) ) ).
cnf(clause_22,axiom,
( ~ t1(X1,X5)
| f1(X0)
| ~ c(X5)
| ~ r1(X0,X1)
| t(X1,u9r1(X1,X0)) ) ).
cnf(clause_15,axiom,
( ~ f1(X0)
| c(u9r5(X0)) ) ).
cnf(u62,negated_conjecture,
e(u11r5(exists)) ).
cnf(u55,negated_conjecture,
f3(exists) ).
cnf(clause_44,axiom,
( ~ t3(X1,X5)
| f3(X0)
| ~ e(X5)
| ~ r3(X0,X1)
| t(X1,u11r3(X1,X0)) ) ).
cnf(clause_37,axiom,
( ~ t(u11r4(X0),X2)
| equalish(X2,X3)
| equalish(X2,X4)
| equalish(X3,X4)
| ~ f3(X0)
| ~ t(u11r4(X0),X4)
| ~ t(u11r4(X0),X3) ) ).
cnf(clause_18,axiom,
( ~ f1(X0)
| r1(X0,u9r4(X0)) ) ).
cnf(u78,negated_conjecture,
( ~ r(exists,X0)
| r2least(exists)
| equalish(X0,u10r4(exists)) ) ).
cnf(u71,negated_conjecture,
t2(u10r4(exists),u10r5(exists)) ).
cnf(u58,negated_conjecture,
c(u9r5(exists)) ).
cnf(clause_51,axiom,
( ~ equalish(u14r2(X0),u14r1(X0))
| ~ r2least(X0) ) ).
cnf(clause_40,axiom,
( ~ equalish(u11r3(X1,X0),u11r1(X1,X0))
| f3(X0)
| ~ t3(X1,X5)
| ~ r3(X0,X1)
| ~ e(X5) ) ).
cnf(u93,negated_conjecture,
( ~ r1(X0,u9r4(exists))
| f1(X0)
| t(u9r4(exists),u9r2(u9r4(exists),X0)) ) ).
cnf(u74,negated_conjecture,
t3(u11r4(exists),u11r5(exists)) ).
cnf(u67,negated_conjecture,
r(exists,u10r4(exists)) ).
cnf(u63,negated_conjecture,
~ c(u11r5(exists)) ).
cnf(u96,negated_conjecture,
( ~ r1(X0,u9r4(exists))
| f1(X0)
| t(u9r4(exists),u9r3(u9r4(exists),X0)) ) ).
cnf(u86,negated_conjecture,
( equalish(u9r4(exists),u11r4(exists))
| r2least(exists) ) ).
cnf(u79,negated_conjecture,
( ~ r(exists,X0)
| r2least(exists)
| equalish(X0,u11r4(exists)) ) ).
cnf(u68,negated_conjecture,
r3(exists,u11r4(exists)) ).
cnf(u108,negated_conjecture,
( ~ r3(X0,u11r4(exists))
| f3(X0)
| t(u11r4(exists),u11r1(u11r4(exists),X0)) ) ).
cnf(u82,negated_conjecture,
( equalish(u11r4(exists),u9r4(exists))
| r2least(exists) ) ).
cnf(clause_20,axiom,
( ~ equalish(u9r3(X1,X0),u9r1(X1,X0))
| f1(X0)
| ~ t1(X1,X5)
| ~ r1(X0,X1)
| ~ c(X5) ) ).
cnf(u122,negated_conjecture,
( ~ t(u10r4(exists),X1)
| equalish(u10r5(exists),X1)
| equalish(X0,X1)
| equalish(u10r5(exists),X0)
| ~ t(u10r4(exists),X0) ) ).
cnf(clause_27,axiom,
( ~ t(u10r4(X0),X2)
| equalish(X2,X3)
| equalish(X2,X4)
| equalish(X3,X4)
| ~ f2(X0)
| ~ t(u10r4(X0),X4)
| ~ t(u10r4(X0),X3) ) ).
cnf(clause_16,axiom,
( ~ f1(X0)
| t1(u9r4(X0),u9r5(X0)) ) ).
cnf(clause_9,axiom,
( ~ e(X0)
| ~ c(X0) ) ).
cnf(clause_6,axiom,
( ~ t1(X0,X1)
| t(X0,X1) ) ).
cnf(u127,negated_conjecture,
( ~ t(u11r4(exists),X1)
| equalish(u11r5(exists),X1)
| equalish(X0,X1)
| equalish(u11r5(exists),X0)
| ~ t(u11r4(exists),X0) ) ).
cnf(clause_49,axiom,
( ~ g(X0)
| r2least(X0) ) ).
cnf(clause_46,axiom,
( ~ f(X0)
| f2(X0) ) ).
cnf(clause_39,axiom,
( ~ equalish(u11r2(X1,X0),u11r1(X1,X0))
| f3(X0)
| ~ t3(X1,X5)
| ~ r3(X0,X1)
| ~ e(X5) ) ).
cnf(clause_28,axiom,
( ~ f2(X0)
| r2(X0,u10r4(X0)) ) ).
cnf(clause_21,axiom,
( ~ equalish(u9r3(X1,X0),u9r2(X1,X0))
| f1(X0)
| ~ t1(X1,X5)
| ~ r1(X0,X1)
| ~ c(X5) ) ).
cnf(clause_2,negated_conjecture,
~ g(exists) ).
cnf(u61,negated_conjecture,
~ c(u10r5(exists)) ).
cnf(clause_42,axiom,
( ~ t3(X1,X5)
| f3(X0)
| ~ e(X5)
| ~ r3(X0,X1)
| t(X1,u11r1(X1,X0)) ) ).
cnf(clause_35,axiom,
( ~ f3(X0)
| e(u11r5(X0)) ) ).
cnf(clause_24,axiom,
( ~ t1(X1,X5)
| f1(X0)
| ~ c(X5)
| ~ r1(X0,X1)
| t(X1,u9r3(X1,X0)) ) ).
cnf(clause_17,axiom,
( ~ t(u9r4(X0),X2)
| equalish(X2,X3)
| equalish(X2,X4)
| equalish(X3,X4)
| ~ f1(X0)
| ~ t(u9r4(X0),X4)
| ~ t(u9r4(X0),X3) ) ).
cnf(u84,negated_conjecture,
( equalish(u10r4(exists),u10r4(exists))
| r2least(exists) ) ).
cnf(u77,negated_conjecture,
( ~ r(exists,X0)
| r2least(exists)
| equalish(X0,u9r4(exists)) ) ).
cnf(u57,negated_conjecture,
f1(exists) ).
cnf(clause_54,axiom,
( ~ r(X0,X1)
| r2least(X0)
| ~ r(X0,X4)
| equalish(X4,X1) ) ).
cnf(clause_47,axiom,
( ~ f(X0)
| f1(X0) ) ).
cnf(u80,negated_conjecture,
( equalish(u9r4(exists),u9r4(exists))
| r2least(exists) ) ).
cnf(u73,negated_conjecture,
t(u10r4(exists),u10r5(exists)) ).
cnf(u70,negated_conjecture,
t1(u9r4(exists),u9r5(exists)) ).
cnf(clause_50,axiom,
( ~ r2least(X0)
| g(X0) ) ).
cnf(u85,negated_conjecture,
( equalish(u11r4(exists),u10r4(exists))
| r2least(exists) ) ).
cnf(u66,negated_conjecture,
r2(exists,u10r4(exists)) ).
cnf(clause_4,axiom,
( ~ r2(X0,X1)
| r(X0,X1) ) ).
cnf(u125,negated_conjecture,
equalish(u10r5(exists),u10r5(exists)) ).
cnf(u99,negated_conjecture,
( ~ r2(X0,u10r4(exists))
| f2(X0)
| t(u10r4(exists),u10r1(u10r4(exists),X0)) ) ).
cnf(u88,negated_conjecture,
( equalish(u11r4(exists),u11r4(exists))
| r2least(exists) ) ).
cnf(u81,negated_conjecture,
( equalish(u10r4(exists),u9r4(exists))
| r2least(exists) ) ).
cnf(clause_11,axiom,
( ~ d(X0)
| ~ e(X0) ) ).
cnf(u118,negated_conjecture,
( ~ t(u9r4(exists),X0)
| equalish(X0,u9r5(exists))
| equalish(u9r5(exists),X0)
| equalish(u9r5(exists),u9r5(exists)) ) ).
cnf(u111,negated_conjecture,
( ~ r3(X0,u11r4(exists))
| f3(X0)
| t(u11r4(exists),u11r2(u11r4(exists),X0)) ) ).
cnf(clause_33,axiom,
( ~ t2(X1,X5)
| f2(X0)
| ~ d(X5)
| ~ r2(X0,X1)
| t(X1,u10r2(X1,X0)) ) ).
cnf(clause_30,axiom,
( ~ equalish(u10r3(X1,X0),u10r1(X1,X0))
| f2(X0)
| ~ t2(X1,X5)
| ~ r2(X0,X1)
| ~ d(X5) ) ).
cnf(clause_23,axiom,
( ~ t1(X1,X5)
| f1(X0)
| ~ c(X5)
| ~ r1(X0,X1)
| t(X1,u9r2(X1,X0)) ) ).
cnf(clause_5,axiom,
( ~ r3(X0,X1)
| r(X0,X1) ) ).
cnf(u114,negated_conjecture,
( ~ r3(X0,u11r4(exists))
| f3(X0)
| t(u11r4(exists),u11r3(u11r4(exists),X0)) ) ).
cnf(u130,negated_conjecture,
equalish(u11r5(exists),u11r5(exists)) ).
cnf(clause_52,axiom,
( ~ r2least(X0)
| r(X0,u14r1(X0)) ) ).
cnf(clause_45,axiom,
( ~ f(X0)
| f3(X0) ) ).
cnf(clause_26,axiom,
( ~ f2(X0)
| t2(u10r4(X0),u10r5(X0)) ) ).
cnf(clause_19,axiom,
( ~ equalish(u9r2(X1,X0),u9r1(X1,X0))
| f1(X0)
| ~ t1(X1,X5)
| ~ r1(X0,X1)
| ~ c(X5) ) ).
cnf(clause_8,axiom,
( ~ t3(X0,X1)
| t(X0,X1) ) ).
cnf(clause_1,negated_conjecture,
f(exists) ).
cnf(u59,negated_conjecture,
d(u10r5(exists)) ).
cnf(clause_48,axiom,
( ~ f3(X0)
| ~ f2(X0)
| ~ f1(X0)
| f(X0) ) ).
cnf(clause_41,axiom,
( ~ equalish(u11r3(X1,X0),u11r2(X1,X0))
| f3(X0)
| ~ t3(X1,X5)
| ~ r3(X0,X1)
| ~ e(X5) ) ).
cnf(clause_38,axiom,
( ~ f3(X0)
| r3(X0,u11r4(X0)) ) ).
cnf(clause_31,axiom,
( ~ equalish(u10r3(X1,X0),u10r2(X1,X0))
| f2(X0)
| ~ t2(X1,X5)
| ~ r2(X0,X1)
| ~ d(X5) ) ).
cnf(u75,negated_conjecture,
t(u11r4(exists),u11r5(exists)) ).
cnf(u64,negated_conjecture,
r1(exists,u9r4(exists)) ).
cnf(u60,negated_conjecture,
~ e(u10r5(exists)) ).
cnf(clause_53,axiom,
( ~ r2least(X0)
| r(X0,u14r2(X0)) ) ).
cnf(clause_34,axiom,
( ~ t2(X1,X5)
| f2(X0)
| ~ d(X5)
| ~ r2(X0,X1)
| t(X1,u10r3(X1,X0)) ) ).
cnf(u87,negated_conjecture,
( equalish(u10r4(exists),u11r4(exists))
| r2least(exists) ) ).
cnf(u69,negated_conjecture,
r(exists,u11r4(exists)) ).
cnf(u56,negated_conjecture,
f2(exists) ).
cnf(u90,negated_conjecture,
( ~ r1(X0,u9r4(exists))
| f1(X0)
| t(u9r4(exists),u9r1(u9r4(exists),X0)) ) ).
cnf(u83,negated_conjecture,
( equalish(u9r4(exists),u10r4(exists))
| r2least(exists) ) ).
cnf(u72,negated_conjecture,
t(u9r4(exists),u9r5(exists)) ).
cnf(u65,negated_conjecture,
r(exists,u9r4(exists)) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS011-1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 22:03:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (20234)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (20239)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.37 % (20241)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (20240)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.37 % (20237)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.37 % (20236)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37 % (20235)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.37 % (20238)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38 TRYING [1]
% 0.15/0.38 % (20239)First to succeed.
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [1,1]
% 0.15/0.38 % (20239)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20234"
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [2,2]
% 0.15/0.38 TRYING [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
% 0.15/0.38 % (20237)Also succeeded, but the first one will report.
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]
% 0.15/0.38 % SZS status Satisfiable for theBenchmark
% 0.15/0.38 % (20239)# SZS output start Saturation.
% See solution above
% 0.15/0.38 % (20239)------------------------------
% 0.15/0.38 % (20239)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (20239)Termination reason: Satisfiable
% 0.15/0.38
% 0.15/0.38 % (20239)Memory used [KB]: 781
% 0.15/0.38 % (20239)Time elapsed: 0.005 s
% 0.15/0.38 % (20239)Instructions burned: 6 (million)
% 0.15/0.38 % (20234)Success in time 0.011 s
%------------------------------------------------------------------------------