TSTP Solution File: LCL909+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL909+1 : TPTP v8.2.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n027.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 : Tue May 21 00:36:54 EDT 2024
% Result : Satisfiable 0.16s 0.40s
% Output : Saturation 0.24s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u96,axiom,
substitution_of_equivalents ).
cnf(u101,axiom,
r5 ).
cnf(u106,axiom,
r4 ).
cnf(u111,axiom,
r3 ).
cnf(u116,axiom,
r2 ).
cnf(u121,axiom,
r1 ).
cnf(u126,axiom,
modus_ponens ).
cnf(u131,axiom,
op_equiv ).
cnf(u136,axiom,
op_and ).
cnf(u141,axiom,
op_implies_or ).
cnf(u145,axiom,
is_a_theorem(implies(or(X0,X0),X0)) ).
cnf(u149,axiom,
is_a_theorem(implies(X1,or(X0,X1))) ).
cnf(u153,axiom,
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ) ).
cnf(u157,axiom,
implies(X0,X1) = or(not(X0),X1) ).
cnf(u163,axiom,
is_a_theorem(implies(or(X0,X1),or(X1,X0))) ).
cnf(u169,axiom,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ).
cnf(u176,axiom,
and(X0,X1) = not(or(not(X0),not(X1))) ).
cnf(u181,axiom,
and(X0,X1) = not(implies(X0,not(X1))) ).
cnf(u185,axiom,
is_a_theorem(implies(X1,implies(X0,X1))) ).
cnf(u191,axiom,
equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ).
cnf(u195,axiom,
is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ).
cnf(u204,axiom,
is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ).
cnf(u217,axiom,
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X0) ) ).
cnf(u221,axiom,
( is_a_theorem(or(X1,X0))
| ~ is_a_theorem(X0) ) ).
cnf(u229,axiom,
is_a_theorem(implies(implies(X0,not(X0)),not(X0))) ).
cnf(u234,axiom,
is_a_theorem(or(and(X0,X0),not(X0))) ).
cnf(u240,axiom,
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ) ).
cnf(u248,axiom,
is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))) ).
cnf(u252,axiom,
is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1))) ).
cnf(u266,axiom,
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ) ).
cnf(u270,axiom,
implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2) ).
cnf(u274,axiom,
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u278,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2)))) ).
cnf(u282,axiom,
( ~ is_a_theorem(or(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(X0,X2))) ) ).
cnf(u286,axiom,
is_a_theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1)))) ).
cnf(u290,axiom,
is_a_theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))) ).
cnf(u329,axiom,
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(X0) ) ).
cnf(u351,axiom,
and(X2,implies(X0,not(X1))) = not(implies(X2,and(X0,X1))) ).
cnf(u363,axiom,
is_a_theorem(implies(X0,and(X0,X0))) ).
cnf(u377,axiom,
( ~ is_a_theorem(implies(X0,not(X0)))
| is_a_theorem(not(X0)) ) ).
cnf(u388,axiom,
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ) ).
cnf(u392,axiom,
is_a_theorem(or(equiv(X0,X0),not(implies(X0,X0)))) ).
cnf(u396,axiom,
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u400,axiom,
is_a_theorem(or(and(X1,X0),implies(X0,not(X1)))) ).
cnf(u404,axiom,
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ) ).
cnf(u436,axiom,
( is_a_theorem(or(X0,or(X1,X2)))
| ~ is_a_theorem(or(X0,X2)) ) ).
cnf(u447,axiom,
is_a_theorem(or(and(X0,X1),implies(X2,implies(X0,not(X1))))) ).
cnf(u451,axiom,
is_a_theorem(or(and(X0,X1),or(X2,implies(X0,not(X1))))) ).
cnf(u472,axiom,
( ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ) ).
cnf(u476,axiom,
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ) ).
cnf(u480,axiom,
( ~ is_a_theorem(or(X2,implies(X0,X1)))
| is_a_theorem(implies(X0,or(X2,X1))) ) ).
cnf(u484,axiom,
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,implies(X0,X2))) ) ).
cnf(u488,axiom,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))) ).
cnf(u504,axiom,
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X0)) ) ).
cnf(u543,axiom,
is_a_theorem(or(and(X0,X1),implies(or(X2,X0),or(X2,not(X1))))) ).
cnf(u547,axiom,
( ~ is_a_theorem(or(and(X0,X1),X2))
| ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(X2) ) ).
cnf(u551,axiom,
is_a_theorem(implies(implies(not(X1),X2),or(and(X0,X1),implies(X0,X2)))) ).
cnf(u555,axiom,
is_a_theorem(or(and(X0,X1),implies(implies(X2,X0),implies(X2,not(X1))))) ).
cnf(u580,axiom,
is_a_theorem(or(X0,implies(X1,X1))) ).
cnf(u606,axiom,
is_a_theorem(or(and(implies(X0,not(X1)),implies(X0,not(X1))),and(X0,X1))) ).
cnf(u612,axiom,
and(implies(X0,not(X1)),X2) = not(or(and(X0,X1),not(X2))) ).
cnf(u640,axiom,
or(and(X2,implies(X0,not(X1))),X3) = implies(implies(X2,and(X0,X1)),X3) ).
cnf(u725,axiom,
or(and(implies(X0,not(X1)),X2),X3) = implies(or(and(X0,X1),not(X2)),X3) ).
cnf(u729,axiom,
is_a_theorem(implies(or(and(X0,X1),X2),implies(or(X3,implies(X0,not(X1))),or(X3,X2)))) ).
cnf(u733,axiom,
is_a_theorem(implies(or(and(X0,X1),X2),implies(implies(X3,implies(X0,not(X1))),implies(X3,X2)))) ).
cnf(u745,axiom,
and(X2,implies(implies(X0,X1),not(implies(X1,X0)))) = not(implies(X2,equiv(X0,X1))) ).
cnf(u749,axiom,
is_a_theorem(implies(or(X3,and(X0,implies(X1,not(X2)))),implies(implies(X0,and(X1,X2)),X3))) ).
cnf(u753,axiom,
is_a_theorem(implies(implies(implies(X0,and(X1,X2)),X3),or(X3,and(X0,implies(X1,not(X2)))))) ).
cnf(u757,axiom,
and(X3,implies(X0,and(X1,X2))) = not(implies(X3,and(X0,implies(X1,not(X2))))) ).
cnf(u1006,axiom,
is_a_theorem(implies(X0,X0)) ).
cnf(u1063,axiom,
and(implies(X0,not(X1)),implies(X2,not(X3))) = not(or(and(X0,X1),and(X2,X3))) ).
cnf(u1152,axiom,
equiv(implies(X0,not(X1)),X2) = and(or(and(X0,X1),X2),implies(X2,implies(X0,not(X1)))) ).
cnf(u1156,axiom,
equiv(X2,implies(X0,not(X1))) = and(implies(X2,implies(X0,not(X1))),or(and(X0,X1),X2)) ).
cnf(u1160,axiom,
is_a_theorem(or(and(implies(X0,and(X1,X2)),implies(X0,and(X1,X2))),and(X0,implies(X1,not(X2))))) ).
cnf(u1284,axiom,
or(and(X3,implies(X0,and(X1,X2))),X4) = implies(implies(X3,and(X0,implies(X1,not(X2)))),X4) ).
cnf(u1430,axiom,
( is_a_theorem(or(X1,or(X0,X2)))
| ~ is_a_theorem(X0) ) ).
cnf(u1434,axiom,
is_a_theorem(implies(implies(X0,X0),equiv(X0,X0))) ).
cnf(u1438,axiom,
( is_a_theorem(implies(X0,or(X1,X2)))
| ~ is_a_theorem(X1) ) ).
cnf(u1442,axiom,
is_a_theorem(or(X0,implies(or(X1,X0),X1))) ).
cnf(u1479,axiom,
is_a_theorem(or(implies(X0,X0),X1)) ).
cnf(u1483,axiom,
is_a_theorem(or(implies(X0,not(X1)),and(X1,X0))) ).
cnf(u1487,axiom,
is_a_theorem(implies(X0,or(and(X1,X0),not(X1)))) ).
cnf(u1491,axiom,
is_a_theorem(or(X0,implies(implies(X1,X0),not(X1)))) ).
cnf(u1564,axiom,
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,not(X1))) ) ).
cnf(u1568,axiom,
( ~ is_a_theorem(or(or(X0,X1),X1))
| is_a_theorem(or(X0,X1)) ) ).
cnf(u1572,axiom,
( is_a_theorem(or(or(X2,X1),X0))
| ~ is_a_theorem(or(X0,X1)) ) ).
cnf(u1576,axiom,
( is_a_theorem(or(X2,implies(X0,X1)))
| ~ is_a_theorem(or(X2,X1)) ) ).
cnf(u1580,axiom,
is_a_theorem(implies(X0,implies(X1,X1))) ).
cnf(u1584,axiom,
( is_a_theorem(implies(X0,or(X1,X2)))
| ~ is_a_theorem(implies(X0,X2)) ) ).
cnf(u1588,axiom,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1))
| ~ is_a_theorem(X0) ) ).
cnf(u1681,axiom,
is_a_theorem(or(equiv(not(X0),not(X0)),and(not(X0),X0))) ).
cnf(u1685,axiom,
is_a_theorem(or(implies(X0,implies(X1,not(X2))),and(X1,X2))) ).
cnf(u1697,axiom,
is_a_theorem(or(X0,or(and(X1,X2),implies(X1,not(X2))))) ).
cnf(u1701,axiom,
is_a_theorem(or(or(X0,implies(X1,not(X2))),and(X1,X2))) ).
cnf(u1705,axiom,
( is_a_theorem(or(and(X0,X0),X1))
| ~ is_a_theorem(implies(not(X0),X1)) ) ).
cnf(u1709,axiom,
is_a_theorem(implies(X0,or(and(X1,X2),implies(X1,not(X2))))) ).
cnf(u1713,axiom,
is_a_theorem(X2) ).
cnf(u1872,axiom,
( ~ is_a_theorem(or(and(X0,X1),X2))
| is_a_theorem(or(and(X1,X0),X2)) ) ).
cnf(u1876,axiom,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ) ).
cnf(u1880,axiom,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ) ).
cnf(u1884,axiom,
is_a_theorem(or(X0,implies(or(X1,or(X0,X2)),or(X1,X2)))) ).
cnf(u1888,axiom,
( is_a_theorem(or(X0,implies(or(X0,X1),X2)))
| ~ is_a_theorem(implies(X1,X2)) ) ).
cnf(u1892,axiom,
is_a_theorem(or(X0,implies(or(or(X0,X1),or(X0,X1)),X1))) ).
cnf(u1896,axiom,
is_a_theorem(or(X0,implies(implies(X1,or(X0,X2)),implies(X1,X2)))) ).
cnf(u2083,axiom,
is_a_theorem(or(and(X0,X1),not(or(and(X0,X1),and(X0,X1))))) ).
cnf(u2087,axiom,
is_a_theorem(or(equiv(X0,X1),implies(implies(X1,X0),not(implies(X0,X1))))) ).
cnf(u2091,axiom,
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(or(X2,X1))
| ~ is_a_theorem(implies(X0,X2)) ) ).
cnf(u2095,axiom,
( ~ is_a_theorem(implies(not(implies(X0,X0)),X1))
| is_a_theorem(or(equiv(X0,X0),X1)) ) ).
cnf(u2107,axiom,
( is_a_theorem(or(and(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(not(X1),X2)) ) ).
cnf(u2111,axiom,
is_a_theorem(implies(or(X0,X1),or(and(X1,X2),or(X0,not(X2))))) ).
cnf(u2115,axiom,
is_a_theorem(or(implies(or(X0,X1),or(X0,not(X2))),and(X1,X2))) ).
cnf(u2119,axiom,
is_a_theorem(or(and(X0,X1),implies(implies(not(X1),X2),implies(X0,X2)))) ).
cnf(u2123,axiom,
is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),implies(X0,not(X2))))) ).
cnf(u2127,axiom,
is_a_theorem(or(implies(implies(X0,X1),implies(X0,not(X2))),and(X1,X2))) ).
cnf(u2131,axiom,
is_a_theorem(or(equiv(X0,X1),not(or(equiv(X0,X1),equiv(X0,X1))))) ).
cnf(u2197,axiom,
is_a_theorem(implies(X0,not(not(X0)))) ).
cnf(u2398,axiom,
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(or(X3,X2))
| ~ is_a_theorem(or(X3,X1)) ) ).
cnf(u2402,axiom,
( ~ is_a_theorem(implies(X2,and(X0,X1)))
| is_a_theorem(not(X2))
| ~ is_a_theorem(implies(X0,not(X1))) ) ).
cnf(u2424,axiom,
is_a_theorem(or(and(not(X0),X1),or(and(X2,X0),implies(X2,not(X1))))) ).
cnf(u2516,axiom,
is_a_theorem(or(equiv(X0,X1),implies(X2,implies(implies(X0,X1),not(implies(X1,X0)))))) ).
cnf(u2520,axiom,
is_a_theorem(or(equiv(X0,X1),or(X2,implies(implies(X0,X1),not(implies(X1,X0)))))) ).
cnf(u2524,axiom,
( ~ is_a_theorem(implies(implies(X0,implies(X1,not(X2))),X3))
| is_a_theorem(or(and(X1,X2),X3)) ) ).
cnf(u2528,axiom,
( ~ is_a_theorem(implies(or(X0,implies(X1,not(X2))),X3))
| is_a_theorem(or(and(X1,X2),X3)) ) ).
cnf(u2532,axiom,
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(or(X2,X3))
| ~ is_a_theorem(or(and(X0,X1),X3)) ) ).
cnf(u2536,axiom,
( is_a_theorem(implies(implies(X0,and(X1,X2)),X3))
| ~ is_a_theorem(and(X0,implies(X1,not(X2)))) ) ).
cnf(u2547,axiom,
X0 = X1 ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL909+1 : TPTP v8.2.0. Released v6.4.0.
% 0.11/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.37 % Computer : n027.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 03:27:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 % (6851)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (6853)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.39 % (6857)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.39 % (6858)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.39 % (6852)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.39 % (6854)WARNING: value z3 for option sas not known
% 0.16/0.39 % (6854)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.40 % (6856)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.40 TRYING [1]
% 0.16/0.40 Finite Model Found!
% 0.16/0.40 % SZS status Satisfiable for theBenchmark
% 0.16/0.40 6852 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.40 % (6852)------------------------------
% 0.16/0.40 % (6852)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 % (6852)Termination reason: Unknown
% 0.16/0.40 % (6852)Termination phase: Finite model building constraint generation
% 0.16/0.40
% 0.16/0.40 % (6852)Memory used [KB]: 959
% 0.16/0.40 % (6852)Time elapsed: 0.008 s
% 0.16/0.40 % (6852)Instructions burned: 10 (million)
% 0.16/0.40 % (6852)------------------------------
% 0.16/0.40 % (6852)------------------------------
% 0.16/0.40 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 % (6855)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.40 TRYING [1]
% 0.16/0.40 Finite Model Found!
% 0.16/0.40 % SZS status Satisfiable for theBenchmark
% 0.16/0.40 6855 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.40 % (6855)------------------------------
% 0.16/0.40 % (6855)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 % (6855)Termination reason: Unknown
% 0.16/0.40 % (6855)Termination phase: Finite model building constraint generation
% 0.16/0.40
% 0.16/0.40 % (6855)Memory used [KB]: 879
% 0.16/0.40 % (6855)Time elapsed: 0.003 s
% 0.16/0.40 % (6855)Instructions burned: 4 (million)
% 0.16/0.40 % (6855)------------------------------
% 0.16/0.40 % (6855)------------------------------
% 0.16/0.40 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.16/0.40 ???
% 0.24/0.42 % (6859)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.24/0.42 TRYING [1]
% 0.24/0.42 Finite Model Found!
% 0.24/0.42 % SZS status Satisfiable for theBenchmark
% 0.24/0.42 6859 Aborted by signal SIGSEGV on /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/0.42 % (6859)------------------------------
% 0.24/0.42 % (6859)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.24/0.42 % (6859)Termination reason: Unknown
% 0.24/0.42 % (6859)Termination phase: Finite model building constraint generation
% 0.24/0.42
% 0.24/0.42 % (6859)Memory used [KB]: 874
% 0.24/0.42 % (6859)Time elapsed: 0.003 s
% 0.24/0.42 % (6859)Instructions burned: 4 (million)
% 0.24/0.42 % (6859)------------------------------
% 0.24/0.42 % (6859)------------------------------
% 0.24/0.42 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 ???
% 0.24/0.42 % (6860)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.24/0.44 % (6861)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.24/0.47 % (6856)First to succeed.
% 0.24/0.47 % (6856)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6851"
% 0.24/0.47 % SZS status Satisfiable for theBenchmark
% 0.24/0.47 % (6856)# SZS output start Saturation.
% See solution above
% 0.24/0.47 % (6856)------------------------------
% 0.24/0.47 % (6856)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.24/0.47 % (6856)Termination reason: Satisfiable
% 0.24/0.47
% 0.24/0.47 % (6856)Memory used [KB]: 2250
% 0.24/0.47 % (6856)Time elapsed: 0.071 s
% 0.24/0.47 % (6856)Instructions burned: 126 (million)
% 0.24/0.47 % (6851)Success in time 0.091 s
%------------------------------------------------------------------------------