TSTP Solution File: KRS006-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : KRS006-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 : n004.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:39 EDT 2024
% Result : Satisfiable 0.22s 0.38s
% Output : Saturation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u61,negated_conjecture,
equalish(u4r1(exist),u4r1(exist)) ).
cnf(u35,negated_conjecture,
s(u4r1(exist),u1r1(u4r1(exist))) ).
cnf(clause_24,axiom,
( ~ r(X0,X2)
| ~ r1most(X0)
| ~ r(X0,X1)
| equalish(X1,X2) ) ).
cnf(clause_17,axiom,
( s(X0,u3r2(X0))
| s1most(X0) ) ).
cnf(clause_14,axiom,
( ~ s(X0,X2)
| ~ s1most(X0)
| ~ s(X0,X1)
| equalish(X1,X2) ) ).
cnf(clause_7,axiom,
( ~ s2least(X0)
| c(X0) ) ).
cnf(u47,negated_conjecture,
( ~ s1most(u4r1(exist))
| equalish(u1r1(u4r1(exist)),u1r1(u4r1(exist))) ) ).
cnf(u80,axiom,
( s2least(X0)
| d(X0) ) ).
cnf(u36,negated_conjecture,
s(u4r1(exist),u1r2(u4r1(exist))) ).
cnf(clause_10,axiom,
( ~ s2least(X0)
| s(X0,u1r2(X0)) ) ).
cnf(clause_3,negated_conjecture,
r(exist,u4r1(exist)) ).
cnf(u85,axiom,
( s(X0,u1r2(X0))
| d(X0) ) ).
cnf(u43,negated_conjecture,
( ~ s(u4r1(exist),X0)
| ~ s1most(u4r1(exist))
| equalish(X0,u1r1(u4r1(exist))) ) ).
cnf(u66,negated_conjecture,
equalish(u4r2(exist),u4r2(exist)) ).
cnf(clause_25,axiom,
( ~ equalish(u5r2(X0),u5r1(X0))
| r1most(X0) ) ).
cnf(clause_22,axiom,
( ~ e(X0)
| r1most(X0) ) ).
cnf(clause_15,axiom,
( ~ equalish(u3r2(X0),u3r1(X0))
| s1most(X0) ) ).
cnf(clause_4,negated_conjecture,
d(u4r2(exist)) ).
cnf(u62,negated_conjecture,
equalish(u4r2(exist),u4r1(exist)) ).
cnf(u44,negated_conjecture,
( ~ s(u4r1(exist),X0)
| ~ s1most(u4r1(exist))
| equalish(X0,u1r2(u4r1(exist))) ) ).
cnf(u37,negated_conjecture,
r(exist,u4r2(exist)) ).
cnf(clause_18,axiom,
( ~ e(X0)
| d(u4r2(X0)) ) ).
cnf(clause_11,axiom,
( ~ s(X0,X2)
| s2least(X0)
| ~ s(X0,X1)
| equalish(X1,X2) ) ).
cnf(u51,negated_conjecture,
( ~ s1most(u4r1(exist))
| equalish(u1r1(u4r1(exist)),u1r2(u4r1(exist))) ) ).
cnf(u30,negated_conjecture,
s1most(u4r2(exist)) ).
cnf(clause_23,axiom,
( ~ r(X0,X1)
| ~ c(X2)
| ~ r1most(X0)
| e(X0)
| ~ d(X1)
| ~ r(X0,X2) ) ).
cnf(clause_12,axiom,
( ~ d(X0)
| s1most(X0) ) ).
cnf(clause_5,negated_conjecture,
c(u4r1(exist)) ).
cnf(u86,axiom,
( s(X0,u1r1(X0))
| d(X0) ) ).
cnf(u52,negated_conjecture,
( ~ s1most(u4r1(exist))
| equalish(u1r2(u4r1(exist)),u1r2(u4r1(exist))) ) ).
cnf(u79,axiom,
( s1most(X0)
| s2least(X0) ) ).
cnf(clause_26,axiom,
( r(X0,u5r1(X0))
| r1most(X0) ) ).
cnf(clause_19,axiom,
( ~ e(X0)
| r(X0,u4r2(X0)) ) ).
cnf(clause_8,axiom,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ) ).
cnf(clause_1,negated_conjecture,
e(exist) ).
cnf(u59,negated_conjecture,
( ~ r(exist,X0)
| equalish(X0,u4r1(exist)) ) ).
cnf(u48,negated_conjecture,
( ~ s1most(u4r1(exist))
| equalish(u1r2(u4r1(exist)),u1r1(u4r1(exist))) ) ).
cnf(u41,axiom,
( ~ s(X0,X1)
| s2least(X0)
| equalish(X1,u3r1(X0))
| s1most(X0) ) ).
cnf(clause_20,axiom,
( ~ e(X0)
| c(u4r1(X0)) ) ).
cnf(clause_13,axiom,
( ~ s1most(X0)
| d(X0) ) ).
cnf(u60,negated_conjecture,
( ~ r(exist,X0)
| equalish(X0,u4r2(exist)) ) ).
cnf(u87,axiom,
( c(X0)
| d(X0) ) ).
cnf(clause_27,axiom,
( r(X0,u5r2(X0))
| r1most(X0) ) ).
cnf(clause_16,axiom,
( s(X0,u3r1(X0))
| s1most(X0) ) ).
cnf(clause_9,axiom,
( ~ s2least(X0)
| s(X0,u1r1(X0)) ) ).
cnf(clause_6,axiom,
( ~ c(X0)
| s2least(X0) ) ).
cnf(u65,negated_conjecture,
equalish(u4r1(exist),u4r2(exist)) ).
cnf(u28,negated_conjecture,
s2least(u4r1(exist)) ).
cnf(clause_21,axiom,
( ~ e(X0)
| r(X0,u4r1(X0)) ) ).
cnf(clause_2,negated_conjecture,
r1most(exist) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS006-1 : TPTP v8.2.0. Released v2.0.0.
% 0.04/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n004.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 22:07:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (6958)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (6963)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.22/0.38 % (6964)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38 % (6965)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38 % (6967)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.22/0.38 % (6966)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38 % (6961)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 Detected minimum model sizes of [1,1]
% 0.22/0.38 Detected maximum model sizes of [1,max]
% 0.22/0.38 TRYING [1,1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [1,2]
% 0.22/0.38 % (6962)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38 % (6965)First to succeed.
% 0.22/0.38 TRYING [3]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [1,3]
% 0.22/0.38 % (6965)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6958"
% 0.22/0.38 % (6963)Also succeeded, but the first one will report.
% 0.22/0.38 TRYING [3]
% 0.22/0.38 Finite Model Found!
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 % (6967)Also succeeded, but the first one will report.
% 0.22/0.38 Detected minimum model sizes of [1,1]
% 0.22/0.38 Detected maximum model sizes of [1,max]
% 0.22/0.38 TRYING [1,1]
% 0.22/0.38 % (6966)Also succeeded, but the first one will report.
% 0.22/0.38 Finite Model Found!
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 % SZS status Satisfiable for theBenchmark
% 0.22/0.38 % (6965)# SZS output start Saturation.
% See solution above
% 0.22/0.38 % (6965)------------------------------
% 0.22/0.38 % (6965)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38 % (6965)Termination reason: Satisfiable
% 0.22/0.38
% 0.22/0.38 % (6965)Memory used [KB]: 754
% 0.22/0.38 % (6965)Time elapsed: 0.006 s
% 0.22/0.38 % (6965)Instructions burned: 4 (million)
% 0.22/0.38 % (6958)Success in time 0.024 s
%------------------------------------------------------------------------------